A characterization of the uncapacitated network design polytope

DOI10.1016/0167-6377(92)90100-HzbMath0766.90078OpenAlexW2087773074MaRDI QIDQ1200785

Johan Hellstrand, Athanasios Migdalas, Torbjörn Larsson

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90100-h

zbMATH Keywords

NP-hardpolyhedral combinatoricsquasi-integralitycontinuous relaxationcyclic flowsuncapaciated network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items

The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Tree network design avoiding congestion ⋮ Column generation in the integral simplex method ⋮ A dynamic programming algorithm for the local access telecommunication network expansion problem

Cites Work

• Simplex pivots on the set packing polytope
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• On the Set-Covering Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of the uncapacitated network design polytope