Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems

DOI10.1137/0405024zbMath0811.05039OpenAlexW2061410562MaRDI QIDQ4018843

Sunil Chopra

Publication date: 16 January 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405024

zbMATH Keywords

facet-defining inequalitiespolyhedronconnectivitydirected graphfacetsminimum weight equivalent subgraph

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (6)

Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ On two-connected subgraph polytopes ⋮ Steiner trees and polyhedra ⋮ Using a hybrid of exact and genetic algorithms to design survivable networks ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope

This page was built for publication: Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems