The Library
EXPERIMENTS IN SOLVING MIXED INTEGER PROGRAMMING-PROBLEMS ON A SMALL ARRAY OF TRANSPUTERS
Tools
UNSPECIFIED (1992) EXPERIMENTS IN SOLVING MIXED INTEGER PROGRAMMING-PROBLEMS ON A SMALL ARRAY OF TRANSPUTERS. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 43 (5). pp. 519-531. ISSN 0160-5682.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management | ||||
Journal or Publication Title: | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | ||||
Publisher: | STOCKTON PRESS | ||||
ISSN: | 0160-5682 | ||||
Official Date: | May 1992 | ||||
Dates: |
|
||||
Volume: | 43 | ||||
Number: | 5 | ||||
Number of Pages: | 13 | ||||
Page Range: | pp. 519-531 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |