On the Complexity of Recognizing Integrality and Total Dual Integrality of the $\{0,1/2\}$-Closure
From MaRDI portal
Publication:6366458
DOI10.1016/j.orl.2021.11.009zbMath1525.90438arXiv2104.14486MaRDI QIDQ6366458
Matthias Brugger, Andreas S. Schulz
Publication date: 29 April 2021
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)
This page was built for publication: On the Complexity of Recognizing Integrality and Total Dual Integrality of the $\{0,1/2\}$-Closure