FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver

DOI10.1023/A:1012982400848MaRDI QIDQ5959286zbMATH OpenFDO

Authors Michael C. Ferris, Jeff Linderoth, Qun Chen

Publication date 26 March 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1012982400848

Mathematics Subject Classification ID

Renewal theory (60K05) Mixed integer programming (90C11)

Review text

In a former paper by \textit{Q. Chen} and \textit{M. C. Ferris} [SIAM J. Optim. 11, 1019--1036 (2001; Zbl 1010.90050)] a first version of the algorithm is given. In this paper an improved version with several advanced features is discussed.

Recommendations

• FATCOP: A fault tolerant condor-PVM mixed integer programming solver
• scientific article; zbMATH DE number 2196290
• Integer-programming software systems
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• MIPLIB 2003

Cited in

(8)

• Analysis of stochastic problem decomposition algorithms in computational grids
• FATCOP
• SelfSplit parallelization for mixed-integer linear programming
• The empirical behavior of sampling methods for stochastic programming
• FATCOP: A fault tolerant condor-PVM mixed integer programming solver
• Challenges in Enterprise Wide Optimization for the Process Industries
• Parallelization of the FICO Xpress-Optimizer
• FiberSCIP—A Shared Memory Parallelization of SCIP

Describes a project that uses

Uses Software

• MIPLIB
• HTCondor MW
• MINTO
• SoPlex
• PVM
• XPRESS
• CPLEX

This page was built for publication: FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959286)