Polyhedral results for the edge capacity polytope.

zbMath1046.90079MaRDI QIDQ1611010

Robert L. M. J. van de Leensel, Arie M. C. A. Koster, Savelsbergh, Martin W. P., Stan P. M. van Hoesel

Publication date: 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

mixed integer programmingcutting planesnetwork designknapsack with integer capacity

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

On the complexity of sequentially lifting cover inequalities for the knapsack polytope, Unsplittable non-additive capacitated network design using set functions polyhedra, Lifting for the integer knapsack cover polyhedron, Bidirected and unidirected capacity installation in telecommunication networks., The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Algorithms for the non-bifurcated network design problem, On cut-based inequalities for capacitated network design polyhedra, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, Cover and pack inequalities for (mixed) integer programming