The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation

DOI10.1016/j.disopt.2005.08.010zbMath1101.90077WikidataQ65553924 ScholiaQ65553924MaRDI QIDQ2506819

José R. Correa, Mourad Baïou

Publication date: 10 October 2006

Published in: Discrete Optimization (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationgraph connectivitypolyhedral combinatorics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (1)

A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs

Cites Work

• Minimum-weight two-connected spanning networks
• A note on the prize collecting traveling salesman problem
• The ellipsoid method and its consequences in combinatorial optimization
• Design of survivable networks
• The Steiner tree polytope and related polyhedra
• Two-edge connected spanning subgraphs and polyhedra
• On two-connected subgraph polytopes
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Generalized steiner problem in series-parallel networks
• Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

This page was built for publication: The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation