A network design problem with two-edge matching failures

DOI10.1051/RO/2014038MaRDI QIDQ5247694zbMATH OpenOpenAlexFDO

Authors Firdovsi Sharifiv, Hakan Kutucu

Publication date 27 April 2015

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2014038

zbMATH Keywords

branch-and-bound methodlinear programmingmatchingnetwork design problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Minimum cost k edges connected subgraph problems
• Hierarchical survivable network design problems
• The 2-path network problem
• A branch-and-cut algorithm for two-level survivable network design problems
• The generalized terminal backup problem

Cites work

• Chordal completions of planar graphs
• Design of Survivable Networks: A survey
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• Minimal triangulations of graphs: a survey
• Network Design Using Cut Inequalities
• On survivable network polyhedra
• Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
• Polyhedral results for two-connected networks with bounded rings
• Separation of partition inequalities
• Separation of partition inequalities for the \((1,2)\)-survivable network design problem
• Two-edge connected spanning subgraphs and polyhedra

Cited in

(3)

• Minimum cost k edges connected subgraph problems
• How to Secure Matchings Against Edge Failures
• How to Secure Matchings against Edge Failures

This page was built for publication: A network design problem with two-edge matching failures

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