Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
From MaRDI portal
Publication:1580430
DOI10.1023/A:1008359223042zbMath0971.90066OpenAlexW1505292335MaRDI QIDQ1580430
András Erik Csallner, Mihály Csaba Markót, Tibor Csendes
Publication date: 26 November 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008359223042
global optimizationinterval arithmeticmultisectionacceleration devicesinterval branch-and-bound algorithms
Related Items (13)
A new multi-section based technique for constrained optimization problems with interval-valued objective function ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Combining interval branch and bound and stochastic search ⋮ Bound constrained interval global optimization in the COCONUT environment ⋮ Use of an interval global optimization tool for exploring feasibility of batch extractive distillation ⋮ On constrained optimization by interval arithmetic and interval order relations ⋮ New interval methods for constrained global optimization ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ The big cube small cube solution method for multidimensional facility location problems ⋮ Interval oriented multi-section techniques for global optimization ⋮ Improved lower bounds for semi-online bin packing problems ⋮ A new pruning test for finding all global minimizers of nonsmooth functions ⋮ Empirical investigation of the convergence speed of inclusion functions in a global otimization context
Uses Software
This page was built for publication: Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
