| Article ID: | iaor20014177 |
| Country: | Netherlands |
| Volume: | 90 |
| Start Page Number: | 19 |
| End Page Number: | 43 |
| Publication Date: | Aug 1999 |
| Journal: | Annals of Operations Research |
| Authors: | Cook William, Bixby Robert E., Lee Eva K., Cox Alan |
| Keywords: | computational analysis: parallel computers |
Numerical experiments for a parallel implementation of a branch-and-bound mixed 0/1 integer programming code are presented. Among its features, the code includes cutting-plane generation at the root node, and employs a new branching-variable selection rule within the search tree. The code runs on a loosely-coupled cluster of workstations using TreadMarks as the parallel software platform. Numerical tests were performed on all mixed 0/1 MIPLIB instances as well as two previously unsolved MIP instances, one arising from telecommunication networks and the other a multicommodity flow problem.