Polyhedral structure of the 4-node network design problem

DOI10.1002/NET.20317MaRDI QIDQ3057114zbMATH OpenOpenAlexFDO

Authors Y. K. Agarwal

Publication date 24 November 2010

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-partitionfacet inequalityinteger programmingmulticommoditynetwork designpolyhedral structure

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Capacitated Network Design—Polyhedral Structure and Computation
• scientific article; zbMATH DE number 2118568
• scientific article; zbMATH DE number 2132072
• Generalized network design polyhedra
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• A polyhedral approach for solving two facility network design problem
• scientific article; zbMATH DE number 1382484
• On capacitated network design cut-set polyhedra
• Optimization of circulant communication networks of dimension 4
• A polyhedral study of the capacity formulation of the multilayer network design problem

Cites work

• A branch-and-cut algorithm for capacitated network design problems
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• A polyhedral approach to multicommodity survivable network design
• Capacitated Network Design—Polyhedral Structure and Computation
• Combinatorial approaches to multiflow problems
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• scientific article; zbMATH DE number 3354799 (Why is no real title available?)
• k-Partition-based facets of the network design problem
• Metric inequalities and the network loading problem
• Minimum cost capacity installation for multicommodity network flows
• Minimum-weight two-connected spanning networks
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Strong formulations for network design problems with connectivity requirements
• Strong inequalities for capacitated survivable network design problems.
• Telecommunication link restoration planning with multiple facility types
• The convex hull of two core capacitated network design problems

Cited in

(4)

• Network loading problem: valid inequalities from 5- and higher partitions
• Survivable network design with shared-protection routing
• Robust Metric Inequalities for Network Loading Under Demand Uncertainty
• k-Partition-based facets of the network design problem

This page was built for publication: Polyhedral structure of the 4-node network design problem

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