Skip to main content
Log in

FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We describe FATCOP 2.0, a new parallel mixed integer program solver that works in an opportunistic computing environment provided by the Condor resource management system. We outline changes to the search strategy of FATCOP 1.0 that are necessary to improve resource utilization, together with new techniques to exploit heterogeneous resources. We detail several advanced features in the code that are necessary for successful solution of a variety of mixed integer test problems, along with the different usage schemes that are pertinent to our particular computing environment. Computational results demonstrating the effects of the changes are provided and used to generate effective default strategies for the FATCOP solver.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R.E. Bixby, S. Ceria, C.M. McZeal and M.W.P. Savelsbergh, MIPLIB 3.0, http://www.caam.rice. edu/~ixby/miplib/miplib.html.

  2. Q. Chen and M.C. Ferris, FATCOP: A fault tolerant Condor-PVM mixed integer program solver, SIAM Journal on Optimization (2001), to appear.

  3. H. Crowder, E.L. Johnson and M.W. Padberg, Solving large scale zero-one linear programming problems, Operations Research 31 (1983) 803–834.

    Google Scholar 

  4. Dash Associates, Blisworth House, Blisworth, Northants, UK, XPRESS-MP User Guide, http://www.dashopt.com/.

  5. J. Eckstein, Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5, SIAM Journal on Optimization 4 (1994) 794–814.

    Google Scholar 

  6. G.A. Geist, A.L. Beguelin, J.J. Dongarra, W. Jiang, R. Manchek and V.S. Sunderam, PVM: Parallel Virtual Machine (MIT Press, Cambridge, MA, 1994).

    Google Scholar 

  7. J.-P. Goux, J. Linderoth and M. Yoder. Metacomputing and the master-worker paradigm, Technical report ANL/MCS-P792-0200, Argonne National Laboratory (2000).

  8. M.S. Hung, W.O. Rom and A.D. Warren, Handbook for IBM OSL (Boyd and Fraser, Danvers, MA, 1994).

    Google Scholar 

  9. ILOG CPLEX Division, 889 Alder Avenue, Incline Village, Nevada, CPLEX Optimizer, http://www.cplex.com/.

  10. A.H. Land and A.G. Doig, An automatic method for solving discrete programming problems, Econometrica 28 (1960) 497–520.

    Google Scholar 

  11. M.J. Litzkow, M. Livny and M.W. Mutka, Condor: A hunter of idle workstations, in: Proceedings of the 8th International Conference on Distributed Computing Systems (June 1988) pp. 104-111.

  12. G.L. Nemhauser, M.W.P. Savelsbergh and G.S. Sigismondi, MINTO, a mixed integer optimizer, Operations Research Letters (1994).

  13. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, NY, 1988).

    Google Scholar 

  14. J. Pruyne and M. Livny, Interfacing Condor and PVM to harness the cycles of workstation clusters, Journal on Future Generations of Computer Systems 12 (1996).

  15. M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA Journal on Computing 6 (1994) 445–454.

    Google Scholar 

  16. T.J. Van Roy and L.A. Wolsey, Solving mixed integer 0-1 programs by automatic reformulation, Operations Research 35 (1987) 45–57.

    Google Scholar 

  17. R. Wunderling, SOPLEX: the sequential object-oriented simplex class library, http://www.zib.de/Optimization/Software/Soplex/.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Q., Ferris, M.C. & Linderoth, J. FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver. Annals of Operations Research 103, 17–32 (2001). https://doi.org/10.1023/A:1012982400848

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012982400848

Navigation