Computational experience with parallel mixed integerprogramming in a distributed environment

R.E. Bixby, W. Cook, A. Cox and E.K. Lee

Annals of Operations Research, 1999, vol. 90, issue 0, 19-43

Abstract: Numerical experiments for a parallel implementation of a branch‐and‐bound mixed 0/1integer programming code are presented. Among its features, the code includes cutting‐planegeneration at the root node, and employs a new branching‐variable selection rulewithin the search tree. The code runs on a loosely‐coupled cluster of workstations usingTreadMarks as the parallel software platform. Numerical tests were performed on all mixed0/1 MIPLIB instances as well as two previously unsolved MIP instances, one arising fromtelecommunication networks and the other a multicommodity flow problem. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018960631213 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:90:y:1999:i:0:p:19-43:10.1023/a:1018960631213

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018960631213

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().