Theoretical justification of a heuristic subbox selection criterion for interval global optimization

zbMath1002.90093MaRDI QIDQ5957418

Vladik Ya. Kreinovich, Tibor Csendes

Publication date: 12 January 2003

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global optimizationinterval methodsbranch and bound approach

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds ⋮ Probabilistic subproblem selection in branch-and-bound algorithms