scientific article; zbMATH DE number 2196281

MaRDI QIDQ5465113zbMATH OpenFDO

Authors C. Nocq, Hervé L. M. Kerivin, A. R. Mahjoub

Publication date 22 August 2005

zbMATH Keywords

branch-and-cutcritical extreme pointcutfacetpolytopeseparation problemtwo-edge connected subgraph

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• On the Polytope of the (1,2)-Survivable Network Design Problem
• More facets for survivable networks
• Design of survivable networks using three- and four-partition facets
• Design of survivable networks

Cited in

(20)

• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• On survivable network polyhedra
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• Separation of partition inequalities with terminals
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• A polyhedral approach for solving two facility network design problem
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• A branch-and-cut algorithm for two-level survivable network design problems
• On the Steiner 2-edge connected subgraph polytope
• On the Polytope of the (1,2)-Survivable Network Design Problem
• The k edge-disjoint 3-hop-constrained paths polytope
• More facets for survivable networks
• The edge-labeled survivable network design problem: formulations and branch-and-cut
• Design of survivable networks using three- and four-partition facets
• Design of Survivable Networks: A survey
• Strong Formulations for 2-Node-Connected Steiner Network Problems
• Design of survivable networks with low connectivity requirements
• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
• Design of survivable IP-over-optical networks

This page was built for publication:

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