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

Achuthan, 1998, Capacitated vehicle routing problems: some new cutting planes, Asia-Pacific Journal of Operational Research, 15, 109 Ascheuer, 2000, A polyhedral study of the asymmetric travelling salesman problem with time windows, Networks, 36, 69, 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q Balas, 1989, The asymmetric assignment problem and some new facets of the travelling salesman polytope on a directed graph, SIAM Journal on Discrete Mathematics, 2, 425, 10.1137/0402038 Balas, 1993, A lifting procedure for the asymmetric travelling salesman problem and a large new class of facets, Mathematical Programming, 58, 325, 10.1007/BF01581274 Balas, 1997, On the monotonization of polyhedra, Mathematical Programming, 78, 59, 10.1016/S0025-5610(96)00073-1 Balas, 1999, Lifted cycle inequalities for the asymmetric travelling salesman problem, Mathematics of Operations Research, 24, 273, 10.1287/moor.24.2.273 Bard, 2002, A branch-and-cut procedure for the vehicle routing problem with time windows, Transportation Science, 36, 250, 10.1287/trsc.36.2.250.565 Barnhart, 1998, Flight string models for aircraft fleeting and routing, Transportation Science, 32, 208, 10.1287/trsc.32.3.208 Boland, 2000, The asymmetric traveling salesman problem with replenishment arcs, European Journal of Operational Research, 123, 408, 10.1016/S0377-2217(99)00266-0 Clarke, 1997, The aircraft rotation problem, Annals of Operations Research: Mathematics of Industrial Systems II, 69, 33, 10.1023/A:1018945415148 Cornuejols, 1993, Polyhedral study of the capacitated vehicle routing problem, Mathematical Programming, 60, 21, 10.1007/BF01580599 Desrochers, 1991, Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints, Operations Research Letters, 10, 27, 10.1016/0167-6377(91)90083-2 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 Fischetti, 1991, Facets of the asymmetric travelling salesman polytope, Mathematics of Operations Research, 16, 42, 10.1287/moor.16.1.42 Fischetti, 1995, Clique tree inequalities define facets of the asymmetric travelling salesman polytope, Discrete Applied Mathematics, 56, 9, 10.1016/0166-218X(93)E0082-A Fischetti, 1994, A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs, Operations Research, 42, 846, 10.1287/opre.42.5.846 Grötschel, 1985, Polyhedral theory Kohl, 1999, 2-path cuts for the vehicle routing problem with time windows, Transportation Science, 33, 395, 10.1287/trsc.33.1.101 Laporte, 1984, Comb inequalities for the vehicle routing problem, Methods of Operations Research, 51, 271 Laporte, 1986, An exact algorithm for the asymmetric capacitated vehicle routing problem, Networks, 16, 33, 10.1002/net.3230160104 Mak, 2000, Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs, International Transactions in Operational Research, 7, 431, 10.1111/j.1475-3995.2000.tb00209.x 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 V. Mak, On the asymmetric travelling salesman problem with replenishment arcs, Ph.D. Thesis, University of Melbourne, Australia, 2001 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 Nemhauser, 1988