ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
From MaRDI portal
Publication:4637829
DOI10.1080/10556788.2018.1428602zbMath1397.90285OpenAlexW2790556967MaRDI QIDQ4637829
Timo Berthold, Stefan Heinz, Yuji Shinano
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.2018.1428602
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Distributed systems (68M14)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- 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
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Mixed Integer Programming: Analyzing 12 Years of Progress
This page was built for publication: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers