A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem

@article{Erdogan2010ABA,
  title={A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem},
  author={G{\"u}nes Erdogan and Jean-François Cordeau and Gilbert Laporte},
  journal={Discrete Applied Mathematics},
  year={2010},
  volume={158},
  pages={1599-1614}
}
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph G=(V,A), at every vertex of which there may be one unit of supply of an item, one unit of demand, or both. The objective is to determine a minimum cost capacitated vehicle route for transporting the items in such a way that all demands are satisfied. The vehicle can carry more than one item at a time. Three mathematical programming formulations of the problem… CONTINUE READING

Topics from this paper.