Generalized network design polyhedra

DOI10.1002/net.20455zbMath1233.90066OpenAlexW2013762253WikidataQ57702171 ScholiaQ57702171MaRDI QIDQ3100692

Martine Labbé, Juan-José Salazar-González, Corinne Feremans, Adam N. Letchford

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20455

zbMATH Keywords

polyhedral combinatoricsgeneralized traveling salesman problemgeneralized minimum spanning tree problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The generalized minimum branch vertices problem: properties and polyhedral analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A study of the quadratic semi-assignment polytope
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The partial constraint satisfaction problem: Facets and lifting theorems
• The approximability of non-Boolean satisfiability problems and restricted integer programming
• Generalized network design problems.
• The cut polytope and the Boolean quadric polytope
• On the power of unique 2-prover 1-round games
• Minimum cuts and related problems
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• On the cut polytope
• On the generalized minimum spanning tree problem
• The symmetric generalized traveling salesman polytope
• Geometry of cuts and metrics