Node selection strategies in interval branch and bound algorithms
From MaRDI portal
Publication:5964243
DOI10.1007/s10898-015-0375-3zbMath1339.90268MaRDI QIDQ5964243
Bertrand Neveu, Ignacio J. Araya, Gilles Trombettoni
Publication date: 29 February 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://hal-enpc.archives-ouvertes.fr/hal-01230893/file/jogotas2.pdf
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
Related Items
\texttt{lsmear}: a variable selection strategy for interval branch and bound solvers, Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms, A generic interval branch and bound algorithm for parameter estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounding in inner regions for global optimization under inequality constraints
- A reliable affine relaxation method for global optimization
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Contractor programming
- Adaptive constructive interval disjunction: algorithms and experiments
- KBFS: K-Best-First Search
- 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
- New interval methods for constrained global optimization
- Constructive Interval Disjunction
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Global Optimization and Constraint Satisfaction
- Experiments with a new selection criterion in a fast interval optimization algorithm
- New subinterval selection criteria for interval global optimization
