Optimal multisections in interval branch-and-bound methods of global optimization

DOI10.1023/B:JOGO.0000049095.55259.61zbMath1136.90521OpenAlexW2007827522MaRDI QIDQ1768626

Jean-Louis Lagouanelle, Gérard Soubry

Publication date: 15 March 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jogo.0000049095.55259.61

zbMATH Keywords

global optimizationinterval branch-and-bound methodoptimal lower boundCentered formoptimal multisection

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (3)

Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Combining interval branch and bound and stochastic search ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers

This page was built for publication: Optimal multisections in interval branch-and-bound methods of global optimization