The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
type: Item
instance of: scholarly article
title: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
zbMATH Open document ID: 0846.90116
DOI: 10.1016/0166-218X(94)00135-Z
author: Collette R. Coullard
author: Abdur Rais
author: Ronald L. Rardin
author: Donald K. Wagner
published in: Discrete Applied Mathematics
publication date: 1996-09-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 897401
zbMATH Keywords: traveling-salesman polytope
zbMATH Keywords: linear-inequality description
zbMATH Keywords: 2-connected Steiner subgraphs
MaRDI profile type: Publication
cites work: Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
cites work: Q5422499
cites work: Q3929516
cites work: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
cites work: The extremal length of a network
cites work: Topology of series-parallel networks
cites work: Q5572841
cites work: Four problems on graphs with excluded minors
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Q4035361
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Two-edge connected spanning subgraphs and polyhedra
cites work: Minimum-weight two-connected spanning networks
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3818127
cites work: Q5524326
cites work: Generalized steiner problem in series-parallel networks
full work available at URL: 0166-218x(94)00135-z
OpenAlex ID: W2103384600
description: scientific article; zbMATH DE number 897401