A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
- 6 August 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (15), 1599-1614
- https://doi.org/10.1016/j.dam.2010.05.025
Abstract
No abstract availableKeywords
Funding Information
- Canadian Natural Sciences and Engineering Research Council (227837-04, 39682-05)
This publication has 14 references indexed in Scilit:
- The preemptive swapping problem on a treeNetworks, 2011
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problemEuropean Journal of Operational Research, 2009
- A branch‐and‐cut algorithm for the nonpreemptive swapping problemNaval Research Logistics (NRL), 2009
- Heuristics for the mixed swapping problemComputers & Operations Research, 2009
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithmsNetworks, 2007
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Nonpreemptive Ensemble Motion Planning on a TreeJournal of Algorithms, 1993
- The swapping problemNetworks, 1992
- An inexact algorithm for the sequential ordering problemEuropean Journal of Operational Research, 1988
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computationsEuropean Journal of Operational Research, 1982