OpenAlex
On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
Work
Year: 2025
Type: article
Abstract: Spatial branch-and-bound algorithms for global minimization of non-convex problems require both lower and upper bounding procedures that finally converge to a globally optimal value in order to ensur... more
Source: Computational Optimization and Applications
Authors Peter Kirst, Christian Füllner
Institutions Wageningen University & Research, Karlsruhe Institute of Technology
Cites: 54
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Topic: Advanced Optimization Algorithms Research
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,990