Highly Influenced

# On splittable and unsplittable flow capacitated network design arc-set polyhedra

@article{Atamtrk2002OnSA, title={On splittable and unsplittable flow capacitated network design arc-set polyhedra}, author={Alper Atamt{\"u}rk and Deepak Rajan}, journal={Math. Program.}, year={2002}, volume={92}, pages={315-333} }

- Published 2002 in Math. Program.
DOI:10.1007/s101070100269

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] isNP–hard, but can be solved over the subspace of fractional… CONTINUE READING

Highly Influential

This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

59 Citations

26 References

Similar Papers