A Parallel Integer Linear Programming Algorithm
The solution of large scale integer linear programming models is generally dependent, in some way, upon the branch and bound technique, which can be quite time consuming. This paper describes a parallel branch and bound algorithm which achieves super linear efficiency in solving integer linear programming models on a multiprocessor computer. The algorithm is used to solve the Haldi and IBM test problems as well as a system design model. © 1988.
R. L. Boehning et al., "A Parallel Integer Linear Programming Algorithm," European Journal of Operational Research, vol. 34, no. 3, pp. 393 - 398, Elsevier, Jan 1988.
The definitive version is available at https://doi.org/10.1016/0377-2217(88)90160-9
Keywords and Phrases
computational analysis; heuristics; Integer programming; parallel algorithm
International Standard Serial Number (ISSN)
Article - Journal
© 2023 Elsevier, All rights reserved.
01 Jan 1988