Experiments with a new selection criterion in a fast interval optimization algorithm
From MaRDI portal
Publication:5940042
DOI10.1023/A:1011220023072zbMath0976.90079MaRDI QIDQ5940042
No author found.
Publication date: 23 September 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Interval and finite arithmetic (65G30)
Related Items (11)
Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Heuristic rejection in interval global optimization ⋮ A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms ⋮ New interval methods for constrained global optimization ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Node selection strategies in interval branch and bound algorithms ⋮ Optimality and duality for second-order interval-valued variational problems ⋮ Optimal centers in branch-and-prune algorithms for univariate global optimization ⋮ A new pruning test for finding all global minimizers of nonsmooth functions
This page was built for publication: Experiments with a new selection criterion in a fast interval optimization algorithm
