\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
From MaRDI portal
Publication:721162
DOI10.1007/s10898-017-0569-yzbMath1402.90123OpenAlexW2754226237MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ Preface to the special issue ``GOW'16
Uses Software
Cites Work
- Unnamed Item
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- Upper bounding in inner regions for global optimization under inequality constraints
- A reliable affine relaxation method for global optimization
- Contractor programming
- An efficient and safe framework for solving optimization problems
- Optimal multisections in interval branch-and-bound methods of global optimization
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- ICOS: a branch and bound based solver for rigorous global optimization
- Constructive Interval Disjunction
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Node selection strategies in interval branch and bound algorithms
