Control strategies for parallel mixed integer branch and bound
Conference
·
OSTI ID:87609
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.
- OSTI ID:
- 87609
- Report Number(s):
- CONF-941118--; ISBN 0-8186-6605-6
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel versus distributed storage and control in parallel mixed integer programming branch and bound
Parallel branch and bound algorithm for integer linear programming models
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35976
Parallel branch and bound algorithm for integer linear programming models
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5787425
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
Journal Article
·
Sat Nov 26 23:00:00 EST 2016
· Operations Research Letters
·
OSTI ID:1340699