Treffer: Complexity of branch-and-bound and cutting planes in mixed-integer optimization.
Title:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization.
Authors:
Basu, Amitabh1 (AUTHOR) basu.amitabh@jhu.edu, Conforti, Michele2 (AUTHOR), Di Summa, Marco2 (AUTHOR), Jiang, Hongyi1 (AUTHOR)
Source:
Mathematical Programming. Mar2023, Vol. 198 Issue 1, p787-810. 24p.
Database:
Business Source Ultimate