Parallel branch and bound algorithm for integer linear programming models
Thesis/Dissertation
·
OSTI ID:5787425
A parallel branch and bound algorithm is developed for use with MIMD computers to study the efficiency of parallel processors on general integer linear programming problems. The Haldi and IBM test problems and a System Design model are used in the implementation of the algorithm. Initially, the algorithm solves the Haldi and IBM test problems on a single processor computer which simulates a multiple processor computer. The algorithm is then implemented on the Denelcor HEP multiprocessor using two of the IBM problems to compare the results of the simulation to the results using a MIMD computer. Finally the algorithm is implemented on the HEP using the System Design model to show a case in which the number of pivots decreases as the number of processes are increased from seven to the process limit of sixteen. In general, it is shown that super linear efficiency can be achieved using multiple processors.
- Research Organization:
- Missouri Univ., Rolla (USA)
- OSTI ID:
- 5787425
- Country of Publication:
- United States
- Language:
- English
Similar Records
Control strategies for parallel mixed integer branch and bound
Parallel Cholesky factorization on a multiprocessor
Randomized algorithms for parallel backtracking and branch-and-bound
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87609
Parallel Cholesky factorization on a multiprocessor
Technical Report
·
Thu Feb 28 23:00:00 EST 1985
·
OSTI ID:6116853
Randomized algorithms for parallel backtracking and branch-and-bound
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5173640