Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
From MaRDI portal
design problems for communication networksedge connectivity constraintsfacet defining inequalitiesminimum cost designminimum spanning treespolyhedral approachpolynomial combinatoricsSteiner treesurvivabilityunreliable nodes and edges
Connectivity (05C40) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
Recommendations
- An Integer Polytope Related to the Design of Survivable Communication Networks
- scientific article; zbMATH DE number 795223
- On the Polytope of the (1,2)-Survivable Network Design Problem
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- A polyhedral approach to multicommodity survivable network design
Cited in
(46)- Directed Steiner problems with connectivity constraints
- Two-edge connected spanning subgraphs and polyhedra
- On perfectly two-edge connected graphs
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
- The Steiner tree packing problem in VLSI design
- On finding two-connected subgraphs in planar graphs
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- New modeling approaches for the design of local access transport area networks
- Fixed charge multicommodity network design using p-partition facets
- On survivable network polyhedra
- The Steiner cycle polytope
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Packing Steiner trees: Polyhedral investigations
- Packing Steiner trees: A cutting plane algorithm and computational results
- Separation of partition inequalities with terminals
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- The Steiner connectivity problem
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
- k-edge connected polyhedra on series-parallel graphs
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Box-total dual integrality and edge-connectivity
- Minimum cost k edges connected subgraph problems
- Survivable network design with shared-protection routing
- Facet generating techniques
- Polyhedral structure of the 4-node network design problem
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Generalized network design polyhedra
- scientific article; zbMATH DE number 2132072 (Why is no real title available?)
- Finding totally independent spanning trees with linear integer programming
- On the Steiner 2-edge connected subgraph polytope
- The k edge-disjoint 3-hop-constrained paths polytope
- An Integer Polytope Related to the Design of Survivable Communication Networks
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- scientific article; zbMATH DE number 2118568 (Why is no real title available?)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
- scientific article; zbMATH DE number 2230214 (Why is no real title available?)
- Minimum-weight two-connected spanning networks
- Probabilistic properties of highly connected random geometric graphs
- Strong inequalities for capacitated survivable network design problems.
- Using a hybrid of exact and genetic algorithms to design survivable networks
- A deep real options policy for sequential service region design and timing
- Survivable network design with demand uncertainty
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- Integral polyhedra related to integer multicommodity flows on a cycle
This page was built for publication: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352817)
