Solving combinatorial optimization problems in parallel: methods and techniques
From MaRDI portal
Publication:1919225
DOI10.1007/BFb0027114zbMath0847.00057OpenAlexW4249698868MaRDI QIDQ1919225
No author found.
Publication date: 4 August 1996
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0027114
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (5)
On estimating workload in interval branch-and-bound global optimization algorithms ⋮ A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm ⋮ Parallel branch and bound for multidimensional scaling with city-block distances ⋮ Parallel metaheuristics: recent advances and new trends ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
This page was built for publication: Solving combinatorial optimization problems in parallel: methods and techniques
