A new multisection technique in interval methods for global optimization
From MaRDI portal
Publication:1840763
DOI10.1007/s006070070010zbMath0967.65079OpenAlexW2010143134MaRDI QIDQ1840763
Tibor Csendes, Leocadio G. Casado, Inmaculada F. García
Publication date: 21 August 2001
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006070070010
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items (10)
Optimal circle covering problems and their applications ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Numerical solution for bounding feasible point sets ⋮ Heuristic rejection in interval global optimization ⋮ Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm ⋮ Efficient interval partitioning for constrained global optimization ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ Some global optimization problems on Stiefel manifolds ⋮ New interval methods for constrained global optimization ⋮ The big cube small cube solution method for multidimensional facility location problems
Uses Software
This page was built for publication: A new multisection technique in interval methods for global optimization
