Node selection strategies in interval branch and bound algorithms
From MaRDI portal
Recommendations
- A new node selection strategy in the branch-and-bound procedure
- An interval branch and bound algorithm for bound constrained optimization problems
- New interval methods for constrained global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Cites work
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- A polyhedral branch-and-cut approach to global optimization
- A reliable affine relaxation method for global optimization
- Adaptive constructive interval disjunction: algorithms and experiments
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Benchmarking global optimization and constraint satisfaction codes
- Constructive Interval Disjunction
- Contractor programming
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- scientific article; zbMATH DE number 1543292 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- KBFS: K-Best-First Search
- New interval methods for constrained global optimization
- New subinterval selection criteria for interval global optimization
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Upper bounding in inner regions for global optimization under inequality constraints
Cited in
(7)- A new node selection strategy in the branch-and-bound procedure
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- A generic interval branch and bound algorithm for parameter estimation
- Node selection through upper bounding local search methods in branch \& bound solvers for NCOPs
- Global solution of quadratic problems using interval methods and convex relaxations
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
This page was built for publication: Node selection strategies in interval branch and bound algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964243)
