Generalized network design polyhedra

DOI10.1002/NET.20455MaRDI QIDQ3100692zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• Generalized network design problems.
• Capacitated Network Design—Polyhedral Structure and Computation
• scientific article; zbMATH DE number 2132072
• Generalized network design problems. Modeling and optimization.
• Polyhedral approaches to the design of survivable networks
• The general routing polyhedron: A unifying framework
• scientific article; zbMATH DE number 176255
• The mixed general routing polyhedron
• Linear networks and convex polytopes
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints

Cites work

• scientific article; zbMATH DE number 3496213 (Why is no real title available?)
• scientific article; zbMATH DE number 3278972 (Why is no real title available?)
• scientific article; zbMATH DE number 3298367 (Why is no real title available?)
• A study of the quadratic semi-assignment polytope
• Generalized network design problems.
• Geometry of cuts and metrics
• Minimum cuts and related problems
• On the cut polytope
• On the generalized minimum spanning tree problem
• On the power of unique 2-prover 1-round games
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The approximability of non-Boolean satisfiability problems and restricted integer programming
• The cut polytope and the Boolean quadric polytope
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• The partial constraint satisfaction problem: Facets and lifting theorems
• The symmetric generalized traveling salesman polytope

Cited in

(8)

• New models of the generalized fixed-charge network design problem
• The generalized minimum branch vertices problem: properties and polyhedral analysis
• Generalized network design problems. Modeling and optimization.
• scientific article; zbMATH DE number 5846238 (Why is no real title available?)
• The general routing polyhedron: A unifying framework
• Generalized network design problems.
• scientific article; zbMATH DE number 2132072 (Why is no real title available?)
• Polyhedral structure of the 4-node network design problem

This page was built for publication: Generalized network design polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100692)