Parallel Branch-and-bound Attraction Based Methods for Global Optimzation

DOI10.1007/0-306-47648-7_10zbMath1211.90295OpenAlexW1543150539MaRDI QIDQ2999084

Julius Žilinskas, Kaj Madsen

Publication date: 11 May 2011

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-306-47648-7_10

zbMATH Keywords

global optimizationparallel branch-and-boundtesting of GO algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers

This page was built for publication: Parallel Branch-and-bound Attraction Based Methods for Global Optimzation