\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers

DOI10.1007/S10898-017-0569-YMaRDI QIDQ721162zbMATH OpenOpenAlexFDO

Authors Bertrand Neveu, I. 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

zbMATH Keywords

branch and boundinterval-based solverLagrangian multipliersvariable selection

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Node selection strategies in interval branch and bound algorithms
• On the combination of interval constraint solvers
• New interval methods for constrained global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects

Cites work

• A polyhedral branch-and-cut approach to global optimization
• A reliable affine relaxation method for global optimization
• Algorithm 681: INTBIS, a portable interval Newton/bisection package
• An efficient and safe framework for solving optimization problems
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Constructive Interval Disjunction
• Contractor programming
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• scientific article; zbMATH DE number 815479 (Why is no real title available?)
• ICOS: a branch and bound based solver for rigorous global optimization
• 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
• Node selection strategies in interval branch and bound algorithms
• Optimal multisections in interval branch-and-bound methods of global optimization
• Subdivision Direction Selection in Interval Methods for Global Optimization
• Upper bounding in inner regions for global optimization under inequality constraints

Cited in

(5)

• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
• Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
• Node selection through upper bounding local search methods in branch \& bound solvers for NCOPs
• Preface to the special issue ``GOW'16

Describes a project that uses

Uses Software

• SoPlex
• INTBIS
• IbexOpt
• ICOS
• ANTIGONE

This page was built for publication: \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721162)