
Summary: We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers. The solver differs from previous parallel branch-and-bound codes by implementing a general purpose parallel mixed integer programming algorithm in an opportunistic multiple processor environment, as opposed to a conventional dedicated environment. It shows how to make effective use of resources as they become available while ensuring the program tolerates resource retreat. The solver performs well on test problems arising from real applications and is particularly useful for solving long running hard mixed integer programming problems.
Numerical mathematical programming methods, Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, condor, branch-and-bound, opportunistic environment, fault tolerance, mixed integer programming
Numerical mathematical programming methods, Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, condor, branch-and-bound, opportunistic environment, fault tolerance, mixed integer programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
