Parallel branch-and-bound attraction based methods for global optimzation

DOI10.1007/0-306-47648-7_10zbMATH Open1211.90295OpenAlexW1543150539MaRDI QIDQ2999084FDOQ2999084

Authors: Kaj Madsen, Julius Žilinskas 

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

Recommendations

• scientific article; zbMATH DE number 1304342
• scientific article; zbMATH DE number 802433
• A parallel interval method implementation for global optimization using dynamic load balancing
• Publication:4885371
• Some new acceleration mechanisms in verified global optimization

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)

Cited In (2)

• Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
• On parallel branch and bound frameworks for global optimization

This page was built for publication: Parallel branch-and-bound attraction based methods for global optimzation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999084)