Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II

Published:2022-10-10 Issue:S1 Volume:42 Page:971-996
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Basu Amitabh,Conforti Michele,Di Summa Marco,Jiang Hongyi

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

https://link.springer.com/content/pdf/10.1007/s00493-022-4884-7.pdf

Reference59 articles.

1. K. Aardal, R. E. Bixby, C. A. J. Hurkens, A. K. Lenstra and J. W. Smeltink: Market split and basis reduction: Towards a solution of the cornuéjols-dawande instances, INFORMS Journal on Computing 12 (2000), 192–202.

2. S. Arora and B. Barak: Computational complexity: a modern approach, Cambridge University Press, 2009.

3. A. Basu: Complexity of optimizing over the integers, arXiv: 2110.06172, 2021.

4. A. Basu, M. Conforti, M. Di Summa and H. Jiang: Complexity of cutting plane and branch-and-bound algorithms for mixed-integer optimization, arXiv: 2003.05023, 2019.

5. P. Beame, N. Fleming, R. Impagliazzo, A. Kolokolova, D. Pankratov, T. Pitassi and R. Robere: Stabbing Planes, in: Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), volume 94 of Leibniz International Proceedings in Informatics (LIPIcs) 10, 1–20, Dagstuhl, Germany, 2018, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resource Allocation with Service Affinity in Large-Scale Cloud Environments;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. An abstract model for branch and cut;Mathematical Programming;2023-06-30