Abstract.
We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separation problem of c–strong inequalities [7] is ??–hard, but can be solved over the subspace of fractional variables only. We introduce two classes of inequalities for the unsplittable flow problems. We present a summary of computational experiments with a branch-and-cut algorithm for multicommodity flow capacitated network design problems to test the effectiveness of the results presented here empirically.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 8, 2000 / Accepted: October 25, 2001¶Published online December 6, 2001
Rights and permissions
About this article
Cite this article
Atamtürk, A., Rajan, D. On splittable and unsplittable flow capacitated network design arc–set polyhedra. Math. Program. 92, 315–333 (2002). https://doi.org/10.1007/s101070100269
Issue Date:
DOI: https://doi.org/10.1007/s101070100269