\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
From MaRDI portal
Publication:721162
DOI10.1007/s10898-017-0569-yzbMath1402.90123MaRDI QIDQ721162
Bertrand Neveu, Ignacio J. Araya
Publication date: 18 July 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0569-y
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Uses Software