A branch‐and‐cut algorithm for the nonpreemptive swapping problem
- 11 May 2009
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 56 (5), 478-486
- https://doi.org/10.1002/nav.20361
Abstract
No abstract availableKeywords
Funding Information
- Canadian Natural Sciences and Engineering Research Council (338816-05, 39682-05)
This publication has 14 references indexed in Scilit:
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveriesNaval Research Logistics (NRL), 1999
- The Swapping Problem on a LineSIAM Journal on Computing, 1999
- Approximating Capacitated Routing and Delivery ProblemsSIAM Journal on Computing, 1999
- The swapping problemNetworks, 1992
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm TravelSIAM Journal on Computing, 1988
- Sequencing of Insertions in Printed Circuit Board AssemblyOperations Research, 1988
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973