Parallelization of the FICO Xpress-Optimizer

DOI10.1080/10556788.2017.1333612zbMath1397.90277OpenAlexW2626957315WikidataQ57259143 ScholiaQ57259143MaRDI QIDQ4637828

J. Doyne Farmer, Timo Berthold, Stefan Heinz, Michael Perregaard

Publication date: 3 May 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1333612

zbMATH Keywords

mixed integer programmingparallelizationmathematical optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Parallel algorithms in computer science (68W10)

Related Items

Progress in mathematical programming solvers from 2001 to 2020, Mitigating anomalies in parallel branch-and-bound based algorithms for mixed-integer nonlinear optimization, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, XPRESS, ParaXpress, Computational aspects of infeasibility analysis in mixed integer programming, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization

Uses Software

• FATCOP
• SCIP
• PICO
• MIPLIB
• CPLEX
• GAMS
• ParaSCIP
• CHiPPS
• MIPLIB2003
• ParaLEX
• Kendo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed processing algorithm for solving integer programs using a cluster of workstations
• Parallel branch, cut, and price for large-scale discrete optimization
• Computational experience with parallel mixed integer programming in a distributed environment
• Parallelization of the FICO Xpress-Optimizer
• A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers
• Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
• Grid-Enabled Optimization with GAMS
• Computational Experience with a Software Framework for Parallel Integer Programming
• Decomposition Principle for Linear Programs
• An Automatic Method of Solving Discrete Programming Problems
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A two-stage parallel branch and bound algorithm for mixed integer programs
• Mixed Integer Programming: Analyzing 12 Years of Progress
• FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver