The asymmetric traveling salesman problem with replenishment arcs
Authors:
- N.L. BolandNBN.L. Boland
- L.W. ClarkeLCL.W. Clarke
- G.L. NemhauserGNG.L. Nemhauser
- 1 June 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (2) , 408-427
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Chapter 2 Time constrained routing and scheduling1995
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994
- A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facetsMathematical Programming, 1993
- An analytical comparison of different formulations of the travelling salesman problemMathematical Programming, 1991
- Chapter II Linear programming1989
- A new approach for crew pairing problems by column generation with an application to air transportationEuropean Journal of Operational Research, 1988
- Algorithms for finding paths with multiple constraintsNetworks, 1984
- Lagrangean relaxation for integer programming1974
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965