A surprising approach in interval global optimization
From MaRDI portal
Publication:1597637
DOI10.1023/A:1014754803382zbMath0993.65069MaRDI QIDQ1597637
Publication date: 30 May 2002
Published in: Reliable Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (3)
A class of problems that can be solved using interval algorithms ⋮ Meta-heuristic interval methods of search of optimal in average control of nonlinear determinate systems with incomplete information about its parameters ⋮ Development of metaheuristic interval minimization methods for optimal program control design
This page was built for publication: A surprising approach in interval global optimization
