scientific article; zbMATH DE number 808514

MaRDI QIDQ4852780zbMATH OpenFDO

Authors

Publication date 24 October 1995

zbMATH Keywords

DIMACSDiscrete optimization problemsNew Brunswick, NJ (USA)Optimization problemsParallel processingProceedingsWorkshop

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(7)

• Efficient massively parallel implementation of some combinatorial algorithms
• On estimating workload in interval branch-and-bound global optimization algorithms
• scientific article; zbMATH DE number 714366 (Why is no real title available?)
• A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
• Mapping tree-structured combinatorial optimization problems onto parallel computers
• Parallel algorithms for global optimization problems
• Special issue: Workshop on discrete optimization DO' 99. Surveys on the State of the Art. RUTCOR - Rutgers Univ. Center for Operations Research, Piscataway, NJ, USA, Summer 1999

This page was built for publication:

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