Timo Hintsch

Orcid: 0000-0002-5111-8872

According to our database1, Timo Hintsch authored at least 4 papers between 2018 and 2021.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem.
Transp. Sci., 2021

Large multiple neighborhood search for the soft-clustered vehicle-routing problem.
Comput. Oper. Res., 2021

2020
Exact solution of the soft-clustered vehicle-routing problem.
Eur. J. Oper. Res., 2020

2018
Large multiple neighborhood search for the clustered vehicle-routing problem.
Eur. J. Oper. Res., 2018


  Loading...