Author of the publication

The multiple TSP with time windows: vehicle bounds based on precedence graphs.

, and . Oper. Res. Lett., 34 (1): 111-120 (2006)

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.

 

Other publications of authors with the same name

Representational Flexibility for Design., and . AID, page 105-128. Springer, (2002)Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times., , and . ACiD, volume 7 of Texts in Algorithmics, page 85-94. King's College, London, (2006)Probabilistic Greedy Heuristics for Satisfiability Problems., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)On polynomial-time approximation algorithms for the variable length scheduling problem., , , , , and . Theor. Comput. Sci., 302 (1-3): 489-495 (2003)The cyclical scheduling problem., , , and . Theor. Comput. Sci., (2014)Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range., , and . IEEE Trans Autom. Sci. Eng., 8 (3): 654-659 (2011)The capacitated max k -cut problem., , and . Math. Program., 115 (1): 65-72 (2008)Metric View Planning Problem with Traveling Cost and Visibility Range., , and . ICRA, page 1292-1297. IEEE, (2007)Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem., , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 211-219. Springer, (2000)Lower Bound for the Unique Games Problem., and . CoRR, (2015)