When Is the Matching Polytope Box-Totally Dual Integral?

DOI10.1287/moor.2017.0852zbMath1432.90084OpenAlexW2263532892MaRDI QIDQ5219300

No author found.

Publication date: 11 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2017.0852

zbMATH Keywords

linear systemmatchingpolytopesigned graphbox-total dual integrality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• The complexity of recognizing linear systems with certain integrality properties
• Matching theory
• Packing cycles in graphs
• On box-perfect graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the odd-minor variant of Hadwiger's conjecture
• On recognizing integer polyhedra
• A Unified Approach to Box-Mengerian Hypergraphs
• On box totally dual integral polyhedra
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: When Is the Matching Polytope Box-Totally Dual Integral?