( en | de | ru )

 

Disambiguation of "Baltz, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

, , , , and . JORS, 66 (4): 615-626 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Baltz

Hermann Baltz

Hans Baltz

Michael Andreas Johannes Baltz

Johannes Baltz

 

Other publications of authors with the same name

The Structure of Maximum Subsets of 1, ..., n with No Solutions to a+b = kc., , , , and . Electron. J. Comb., (2005)On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation., , and . RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 192-201. Springer, (2001)On the Minimum Load Coloring Problem., , , , and . WAOA, volume 3879 of Lecture Notes in Computer Science, page 15-26. Springer, (2005)Constructions of sparse asymmetric connectors with number theoretic methods., , and . Networks, 45 (3): 119-124 (2005)On the minimum load coloring problem., , , , and . J. Discrete Algorithms, 5 (3): 533-545 (2007)Constructions of Sparse Asymmetric Connectors: Extended Abstract., , and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 13-22. Springer, (2003)Approximation algorithms for the Euclidean bipartite TSP., and . Oper. Res. Lett., 33 (4): 403-410 (2005)Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract)., , and . Electron. Notes Discret. Math., (2001)Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory., and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 165-177. Springer, (2003)Coloring Graphs with Minimal Edge Load., , , and . Electron. Notes Discret. Math., (2004)