Author of the publication

A polyhedral study of the asymmetric traveling salesman problem with time windows.

, , and . Networks, 36 (2): 69-79 (2000)

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

Online Dial-a-Ride Problems: Minimizing the Completion Time., , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 639-650. Springer, (2000)Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut., , and . Math. Program., 90 (3): 475-506 (2001)On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem., , , and . IPCO, page 19-28. University of Waterloo Press, (1990)A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints., , and . Comput. Optim. Appl., 17 (1): 61-84 (2000)A polyhedral study of the asymmetric traveling salesman problem with time windows., , and . Networks, 36 (2): 69-79 (2000)Order picking in an automatic warehouse: Solving online asymmetric TSPs., , and . Math. Methods Oper. Res., 49 (3): 501-515 (1999)A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)., , , and . SIAM J. Optimization, 3 (1): 25-42 (1993)A nation-wide optimization study on the consolidation of local exchanges using long-reach passive optical networks., , and . ICTON, page 1-5. IEEE, (2014)