Article ID: | iaor20013560 |
Country: | Netherlands |
Volume: | 101 |
Issue: | 1/3 |
Start Page Number: | 13 |
End Page Number: | 36 |
Publication Date: | Apr 2000 |
Journal: | Discrete Applied Mathematics |
Authors: | Conforti Michele, Fischetti Matteo, Brunetta Lorenzo |
Keywords: | programming: integer |
In this paper we propose a branch-and-cut algorithm for the exact solution of an integer multicommodity flow problem. This NP-hard problem finds important applications in transportation, very large scale integration design, and telecommunications. We consider alternative formulations of the problem and describe several classes of valid inequalities. We describe lifting procedures to extend a given valid inequality for the problem with