A parallel integer linear programming algorithm |
| |
| Institution: | 1. Department of Physics, Harvard University, Cambridge, MA 02138, USA;2. Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada;1. School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, PR China;2. School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou 221116, PR China;1. 5765 S. Blackstone Ave., Chicago, IL 60637, USA;2. Institut des Hautes Etudes Scientifiques, Le Bois-Marie, 35 route de Chartres, F-91440 Bures-sur-Yvette, France;3. Institut de Physique Théorique, CEA, IPhT, F-91191 Gif-sur-Yvette, France;4. CNRS, URA 2306, F-91191 Gif-sur-Yvette, France |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
