Complexity of branch-and-bound and cutting planes in mixed-integer optimization
From MaRDI portal
Publication:6336516
DOI10.1007/s10107-022-01789-5zbMath1512.90144arXiv2003.05023MaRDI QIDQ6336516
Michele Conforti, Amitabh Basu, Hongyi Jiang, Marco Di Summa
Publication date: 10 March 2020
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60)
This page was built for publication: Complexity of branch-and-bound and cutting planes in mixed-integer optimization