On estimating workload in interval branch-and-bound global optimization algorithms
From MaRDI portal
Publication:2392108
DOI10.1007/s10898-011-9771-5zbMath1275.90062MaRDI QIDQ2392108
Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada F. García, José L. Berenguel
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9771-5
global optimization; branch-and-bound; interval arithmetic; parallel algorithms; workload prediction
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization