default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Hansknecht
Person information
- affiliation: TU Clausthal, Germany
- affiliation (former): Technische Universität Braunschweig, Braunschweig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Christoph Hansknecht:
Dynamic flow problems arising from traffic planning (Dynamische Flussprobleme in der Verkehrsplanung). Braunschweig University of Technology, Germany, 2022
Journal Articles
- 2024
- [j6]Christoph Hansknecht
, Christian Kirches, Paul Manns:
Convergence of successive linear programming algorithms for noisy functions. Comput. Optim. Appl. 88(2): 567-601 (2024) - 2023
- [j5]Christoph Hansknecht, Imke Joormann, Bernd Korn, Fabian Morscheck, Sebastian Stiller:
Feeder routing for air-to-air refueling operations. Eur. J. Oper. Res. 304(2): 779-796 (2023) - 2022
- [j4]Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns:
Switching Cost Aware Rounding for Relaxations of Mixed-Integer Optimal Control Problems: The 2-D Case. IEEE Control. Syst. Lett. 6: 548-553 (2022) - 2021
- [j3]Christoph Hansknecht, Imke Joormann, Sebastian Stiller:
Dynamic Shortest Paths Methods for the Time-Dependent TSP. Algorithms 14(1): 21 (2021) - [j2]Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns:
Mixed-integer optimal control problems with switching costs: a shortest path approach. Math. Program. 188(2): 621-652 (2021) - [j1]Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie:
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17(1): 3:1-3:58 (2021)
Conference and Workshop Papers
- 2019
- [c4]Felix Bestehorn, Christoph Hansknecht, Christian Kirches, Paul Manns:
A switching cost aware rounding method for relaxations of mixed-integer optimal control problems. CDC 2019: 7134-7139 - 2018
- [c3]Christoph Hansknecht, Alexander T. Richter, Sebastian Stiller:
Fast Robust Shortest Path Computations. ATMOS 2018: 5:1-5:21 - 2017
- [c2]Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie:
Tight Bounds for Online TSP on the Line. SODA 2017: 994-1005 - 2014
- [c1]Christoph Hansknecht, Max Klimm, Alexander Skopalik:
Approximate Pure Nash Equilibria in Weighted Congestion Games. APPROX-RANDOM 2014: 242-257
Informal and Other Publications
- 2024
- [i2]Christoph Hansknecht, Bernhard Heinzelreiter, John W. Pearson, Andreas Potschka:
A Framework for the Solution of Tree-Coupled Saddle-Point Systems. CoRR abs/2410.23385 (2024) - 2019
- [i1]Vincent Froese, Christoph Hansknecht:
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces. CoRR abs/1912.02300 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
