Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
From MaRDI portal
Publication:3613504
DOI10.1007/978-0-387-09707-7_8zbMath1188.68353OpenAlexW1828893556MaRDI QIDQ3613504
Julius Žilinskas, Remigijus Paulavičius
Publication date: 12 March 2009
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-09707-7_8
Related Items (3)
On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
Cites Work
This page was built for publication: Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
