Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

Discrete Optimization

Volumn 3, Issue 1, 2006, Pages 33-49

  Mak, Vicky ^a   Boland, Natashia ^b  

^a DEAKIN UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Combinatorial optimisation; Polyhedral combinatorics; Travelling salesman

Indexed keywords

AIRCRAFT; ALGORITHMS; COMBINATORIAL MATHEMATICS; GRAPH THEORY; NETWORK PROTOCOLS; OPTIMIZATION;

AIRCRAFT ROUTING; POLYHEDRAL COMBINATORICS;

TRAVELING SALESMAN PROBLEM;

EID: 33244488338     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.10.003     Document Type: Article

References (25)

1. N.R. Achuthan, L. Caccetta, and S.P. Hill Capacitated vehicle routing problems: some new cutting planes Asia-Pacific Journal of Operational Research 15 1998 109 123
2. N. Ascheuer, M. Fischetti, and M. Grötschel A polyhedral study of the asymmetric travelling salesman problem with time windows Networks 36 2000 69 79
3. E. Balas The asymmetric assignment problem and some new facets of the travelling salesman polytope on a directed graph SIAM Journal on Discrete Mathematics 2 4 1989 425 451
4. E. Balas, and M. Fischetti A lifting procedure for the asymmetric travelling salesman problem and a large new class of facets Mathematical Programming 58 1993 325 352
5. E. Balas, and M. Fischetti On the monotonization of polyhedra Mathematical Programming 78 1997 59 84
6. E. Balas, and M. Fischetti Lifted cycle inequalities for the asymmetric travelling salesman problem Mathematics of Operations Research 24 2 1999 273 292
7. J.F. Bard, G. Kontoravdis, and G. Yu A branch-and-cut procedure for the vehicle routing problem with time windows Transportation Science 36 2002 250 269
8. C. Barnhart, N.L. Boland, L.W. Clarke, G.L. Nemhauser, and R.G. Shenoi Flight string models for aircraft fleeting and routing Transportation Science 32 1998 208 220
9. N.L. Boland, L.W. Clarke, and G.L. Nemhauser The asymmetric traveling salesman problem with replenishment arcs European Journal of Operational Research 123 2000 408 427
10. L.W. Clarke, E.L. Johnson, G.L. Nemhauser, and Z. Zhu The aircraft rotation problem Annals of Operations Research: Mathematics of Industrial Systems II 69 1997 33 46
11. G. Cornuejols, and F. Harche Polyhedral study of the capacitated vehicle routing problem Mathematical Programming 60 1993 21 52
12. M. Desrochers, and G. Laporte Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints Operations Research Letters 10 1991 27 36
13. A. Ernst, V. Mak, On the minimum makespan machine scheduling problem with sequence dependent setups and due dates, Technical Report TR M05/01, School of Information Technology, Deakin University, 2005
14. M. Fischetti Facets of the asymmetric travelling salesman polytope Mathematics of Operations Research 16 1991 42 56
15. M. Fischetti Clique tree inequalities define facets of the asymmetric travelling salesman polytope Discrete Applied Mathematics 56 1995 9 18
16. M. Fischetti, P. Toth, and D. Vigo A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs Operations Research 42 1994 846 859
17. M. Grötschel, and M.W. Padberg Polyhedral theory E.L. Lawler J.K. Lenstra A.H.G. Rinnooy Kan D.B. Shmoys The Travelling Salesman Problem 1985 Wiley
18. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1999 395 406
19. G. Laporte, and Y. Norbert Comb inequalities for the vehicle routing problem Methods of Operations Research 51 1984 271 276
20. G. Laporte, H. Mercure, and Y. Norbert An exact algorithm for the asymmetric capacitated vehicle routing problem Networks 16 1986 33 46
21. V. Mak, and N. Boland Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs International Transactions in Operational Research 7 2000 431 447
22. V. Mak, N. Boland, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Technical Report TR M05/03, School of Information Technology, Deakin University, 2005
23. V. Mak, On the asymmetric travelling salesman problem with replenishment arcs, Ph.D. Thesis, University of Melbourne, Australia, 2001
24. V. Mak, A. Ernst, New cutting planes for the time and/or precedence constrained asymmetric travelling salesman problem and vehicle routing problem, Technical Report TR M05/04, School of Information Technology, Deakin University, 2005
25. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley