Recognizing conic TDI systems is hard

DOI10.1007/s10107-009-0294-5zbMath1218.90226OpenAlexW2055425498MaRDI QIDQ543398

Júlia Pap

Publication date: 17 June 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0294-5

zbMATH Keywords

Hilbert basistotally dual integral

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Total dual dyadicness and dyadic generating sets ⋮ Testing additive integrality gaps ⋮ Trader multiflow and box-TDI systems in series-parallel graphs ⋮ Characterizing and recognizing generalized polymatroids ⋮ Alternatives for testing total dual integrality ⋮ Total dual integrality of the linear complementarity problem ⋮ Box-total dual integrality, box-integrality, and equimodular matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Total dual integrality and integer polyhedra
• The complexity of recognizing linear systems with certain integrality properties
• The height of minimal Hilbert bases
• A polynomial-time test for total dual integrality in fixed dimension

This page was built for publication: Recognizing conic TDI systems is hard