The connection machine
Vector models for data-parallel computing
Vector models for data-parallel computing
Active messages: a mechanism for integrated communication and computation
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Unstructured tree search on SIMD parallel computers: a summary of results
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A SIMD approach to parallel heuristic search
Artificial Intelligence
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Scalable load balancing techniques for parallel computers
Journal of Parallel and Distributed Computing
Load Balancing for Distributed Branch and Bound Algorithms
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Load Balancing in a Network of Transputers
Proceedings of the 2nd International Workshop on Distributed Algorithms
Computational Optimization and Applications
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
| Hi-index | 0.00 |
Mixed integer programs are numerical optimization problems that arise frequently in operations research, particularly in industrial logistics and tactical planning. Their classical solution method is a tree-search branch and bound algorithm in which each tree node represents a linear program. This paper describes an implementation of general mixed integer branch and bound that runs on the CM5 family of parallel processors. This code allows varying amounts of centralization, and combines the randomized work-distribution scheme of Karp and Zhang with a global load-balancing method based on SIMD algorithms. This combination proves effective in an asynchronous, MIMD setting.