Parallel Search Algorithms for Discrete Optimization Problems

DOI10.1287/ijoc.7.4.365zbMath0843.90098OpenAlexW3029849211MaRDI QIDQ4869753

Vipin Kumar, Ananth Grama

Publication date: 12 March 1996

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.7.4.365

zbMATH Keywords

surveyscalabilityload balancingcommunication costsparallel search algorithmsspeedup anomalies

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items

Nagging: A scalable fault-tolerant paradigm for distributed search ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ Unnamed Item ⋮ Heuristic allocation based on a dynamic programming state-space representation