首页 | 本学科首页   官方微博 | 高级检索  
     


Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
Authors:Robert W. Ashford  Peter Connard  Robert Daniel
Affiliation:1.School of Industrial and Business Studies, University of Warwick,;2.Department of Business Studies,University of Buckingham,
Abstract:The time-consuming process of solving large-scale Mixed Integer Programming problems using the branch-and-bound technique can be speeded up by introducing a degree of parallelism into the basic algorithm. This paper describes the development and implementation of a parallel branch-and-bound algorithm created by adapting a commercial MIP solver. Inherent in the design of this software are certain ad hoc methods, the use of which are necessary in the effective solution of real problems. The extent to which these ad hoc methods can successfully be transferred to a parallel environment, in this case an array of at most nine transputers, is discussed. Computational results on a variety of real integer programming problems are reported.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号