BASU, Amitabh, CONFORTI, Michele, DI SUMMA, Marco und JIANG, Hongyi, 2023. Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Mathematical Programming. 1 März 2023. Vol. 198, no. 1, p. 787-810. DOI 10.1007/s10107-022-01789-5.
Elsevier - Harvard (with titles)Basu, A., Conforti, M., Di Summa, M., Jiang, H., 2023. Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Mathematical Programming 198, 787-810. https://doi.org/10.1007/s10107-022-01789-5
American Psychological Association 7th editionBasu, A., Conforti, M., Di Summa, M., & Jiang, H. (2023). Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Mathematical Programming, 198(1), 787-810. https://doi.org/10.1007/s10107-022-01789-5
Springer - Basic (author-date)Basu A, Conforti M, Di Summa M, Jiang H (2023) Complexity of branch-and-bound and cutting planes in mixed-integer optimization.. Mathematical Programming 198:787-810. https://doi.org/10.1007/s10107-022-01789-5
Juristische Zitierweise (Stüber) (Deutsch)Basu, Amitabh/ Conforti, Michele/ Di Summa, Marco/ Jiang, Hongyi, Complexity of branch-and-bound and cutting planes in mixed-integer optimization., Mathematical Programming 2023, 787-810.