Timo Hintsch

According to our database, Timo Hintsch authored at least 5 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

A fast optimization approach for a complex real-life 3D Multiple Bin Size Bin Packing Problem.

Katrin Heßler, Timo Hintsch, Lukas Wienkamp

Eur. J. Oper. Res., 2025

2021

Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem.

Timo Hintsch, Stefan Irnich, Lone Kiilerich

Transp. Sci., 2021

Large multiple neighborhood search for the soft-clustered vehicle-routing problem.

Timo Hintsch

Comput. Oper. Res., 2021

2020

Exact solution of the soft-clustered vehicle-routing problem.

Timo Hintsch, Stefan Irnich

Eur. J. Oper. Res., 2020

2018

Large multiple neighborhood search for the clustered vehicle-routing problem.

Timo Hintsch, Stefan Irnich

Eur. J. Oper. Res., 2018