Achim Hildenbrandt

Orcid: 0000-0002-1527-494X

According to our database1, Achim Hildenbrandt authored at least 5 papers between 2013 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A branch-and-cut algorithm for the target visitation problem.
EURO J. Comput. Optim., 2019

2017
Traveling Salesman Problems with Additional Ordering Constraints.
Proceedings of the Operations Research Proceedings 2017, 2017

2015
The Target Visitation Problem
PhD thesis, 2015

Inter Programming Models for the Target Visitation Problem.
Informatica (Slovenia), 2015

2013
A Flow Formulation for the Optimum Communication Spanning Tree.
Electron. Notes Discret. Math., 2013


  Loading...