A parallel integer linear programming algorithm

Abstract

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.

Department(s)

Computer Science

Document Type

Article

DOI

https://doi.org/10.1016/0377-2217(88)90160-9

Keywords

computational analysis, heuristics, Integer programming, parallel algorithm

Publication Date

1-1-1988

Journal Title

European Journal of Operational Research

Link to Full Text

Share

COinS