Solving combinatorial optimization problems in parallel: methods and techniques

DOI10.1007/BFB0027114MaRDI QIDQ1919225zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

Combinatorial optimization problemsParallel techniques

Mathematics Subject Classification ID

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)

Cited in

(11)

• An introduction to parallelism in combinatorial optimization
• A portable and scalable algorithm for a class of constrained combinatorial optimization problems
• On estimating workload in interval branch-and-bound global optimization algorithms
• scientific article; zbMATH DE number 1163099 (Why is no real title available?)
• scientific article; zbMATH DE number 2087094 (Why is no real title available?)
• scientific article; zbMATH DE number 1852165 (Why is no real title available?)
• Parallel metaheuristics: recent advances and new trends
• Parallel Combinatorial Optimization with Decision Diagrams
• 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
• 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

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