Hendel, Gregor; Anderson, Daniel; Le Bodic, Pierre; Pfetsch, Marc E. Estimating the size of branch-and-bound trees. (English) Zbl 07551218 INFORMS J. Comput. 34, No. 2, 934-952 (2022). MSC: 90-XX PDFBibTeX XMLCite \textit{G. Hendel} et al., INFORMS J. Comput. 34, No. 2, 934--952 (2022; Zbl 07551218) Full Text: DOI
Avis, David; Jordan, Charles mplrs: a scalable parallel vertex/facet enumeration code. (English) Zbl 1400.90222 Math. Program. Comput. 10, No. 2, 267-302 (2018). MSC: 90C05 PDFBibTeX XMLCite \textit{D. Avis} and \textit{C. Jordan}, Math. Program. Comput. 10, No. 2, 267--302 (2018; Zbl 1400.90222) Full Text: DOI arXiv
Goloveshkin, V. A.; Zhukova, G. N.; Ulyanov, M. V.; Fomichev, M. I. Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data. (English. Russian original) Zbl 1490.90248 Autom. Remote Control 79, No. 7, 1296-1310 (2018); translation from Avtom. Telemekh. 2018, No. 7, 149-166 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{V. A. Goloveshkin} et al., Autom. Remote Control 79, No. 7, 1296--1310 (2018; Zbl 1490.90248); translation from Avtom. Telemekh. 2018, No. 7, 149--166 (2018) Full Text: DOI
Fischetti, Matteo; Monaci, Michele; Salvagnin, Domenico SelfSplit parallelization for mixed-integer linear programming. (English) Zbl 1391.90429 Comput. Oper. Res. 93, 101-112 (2018). MSC: 90C11 65K05 65Y05 PDFBibTeX XMLCite \textit{M. Fischetti} et al., Comput. Oper. Res. 93, 101--112 (2018; Zbl 1391.90429) Full Text: DOI Link
Berthold, Timo; Hendel, Gregor; Koch, Thorsten From feasibility to improvement to proof: three phases of solving mixed-integer programs. (English) Zbl 1398.90107 Optim. Methods Softw. 33, No. 3, 499-517 (2018). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{T. Berthold} et al., Optim. Methods Softw. 33, No. 3, 499--517 (2018; Zbl 1398.90107) Full Text: DOI
Lodi, Andrea; Zarpellon, Giulia On learning and branching: a survey. (English) Zbl 1372.90003 Top 25, No. 2, 207-236 (2017). MSC: 90-02 68T05 90C57 90C11 90C59 PDFBibTeX XMLCite \textit{A. Lodi} and \textit{G. Zarpellon}, Top 25, No. 2, 207--236 (2017; Zbl 1372.90003) Full Text: DOI
Berenguel, José L.; Casado, L. G.; García, I.; Hendrix, Eligius M. T. On estimating workload in interval branch-and-bound global optimization algorithms. (English) Zbl 1275.90062 J. Glob. Optim. 56, No. 3, 821-844 (2013). MSC: 90C26 90C57 PDFBibTeX XMLCite \textit{J. L. Berenguel} et al., J. Glob. Optim. 56, No. 3, 821--844 (2013; Zbl 1275.90062) Full Text: DOI
Koch, Thorsten; Ralphs, Ted; Shinano, Yuji Could we use a million cores to solve an integer program? (English) Zbl 1262.90106 Math. Methods Oper. Res. 76, No. 1, 67-93 (2012). MSC: 90C10 PDFBibTeX XMLCite \textit{T. Koch} et al., Math. Methods Oper. Res. 76, No. 1, 67--93 (2012; Zbl 1262.90106) Full Text: DOI
Nash, Stephen G.; Lewis, Robert Michael Assessing the performance of an optimization-based multilevel method. (English) Zbl 1228.65091 Optim. Methods Softw. 26, No. 4-5, 693-717 (2011). MSC: 65K05 90C06 90C30 65N55 PDFBibTeX XMLCite \textit{S. G. Nash} and \textit{R. M. Lewis}, Optim. Methods Softw. 26, No. 4--5, 693--717 (2011; Zbl 1228.65091) Full Text: DOI