Christoph Hansknecht

Feeder routing for air-to-air refueling operations

B. Korn, S. Stiller, Christoph Hansknecht, 2022, Eur. J. Oper. Res..

Christoph Hansknecht and Sebastian Stiller Heuristics for a collaborative routing problem

S. Stiller, Christoph Hansknecht, 2022 .

Cuts, Primal Heuristics, and Learning to Branch for the Time-Dependent Traveling Salesman Problem

Sebastian May, Christoph Hansknecht, Imke Joormann, 2018, 1805.01415.

Mixed-integer optimal control problems with switching costs: a shortest path approach

Christian Kirches, Paul Manns, Christoph Hansknecht, 2020, Mathematical Programming.

Cuts, Primal Heuristics, and Learning to Branch for the Time-Dependent Traveling Salesman Problem

Sebastian Stiller, Christoph Hansknecht, Imke Joormann, 2018, 1805.01415.

Tight Bounds for Online TSP on the Line

Leen Stougie, Maarten Lipmann, Kevin Schewior, 2017, SODA.

Non-uniform Grid Refinement for the Combinatorial Integral Approximation

C. Kirches, Paul Manns, Christoph Hansknecht, 2023, 2305.12846.

Switching Cost Aware Rounding for Relaxations of Mixed-Integer Optimal Control Problems: the Two-Dimensional Case

C. Kirches, Paul Manns, Christoph Hansknecht, 2022 .

A switching cost aware rounding method for relaxations of mixed-integer optimal control problems

Christian Kirches, Paul Manns, Christoph Hansknecht, 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces

Vincent Froese, Christoph Hansknecht, Christoph Hansknecht, 2019, ArXiv.