The box-TDI system associated with 2-edge connected spanning subgraphs

DOI10.1016/j.dam.2008.05.001zbMath1173.05310OpenAlexW2039307354MaRDI QIDQ1003761

Guoli Ding, Wenan Zang, Xu-jin Chen

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.001

zbMATH Keywords

graphpolyhedrontraveling salesman problemcutbox total dual integrality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

On box-perfect graphs ⋮ Trader multiflow and box-TDI systems in series-parallel graphs ⋮ Box-total dual integrality and edge-connectivity ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ The Schrijver system of the flow cone in series-parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• Packing circuits in matroids
• The traveling salesman problem in graphs with some excluded minors
• Two-edge connected spanning subgraphs and polyhedra
• On perfectly two-edge connected graphs
• Operations that preserve total dual integrality
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Topology of series-parallel networks
• The traveling salesman problem on a graph and some related integer polyhedra
• On box totally dual integral polyhedra
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

This page was built for publication: The box-TDI system associated with 2-edge connected spanning subgraphs