Could we use a million cores to solve an integer program?
From MaRDI portal
Publication:1935943
DOI10.1007/s00186-012-0390-9zbMath1262.90106OpenAlexW2054209364MaRDI QIDQ1935943
Thorsten Koch, Yuji Shinano, Ted K. Ralphs
Publication date: 20 February 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-012-0390-9
Related Items
\texttt{mplrs}: a scalable parallel vertex/facet enumeration code, SelfSplit parallelization for mixed-integer linear programming, On relations between chance constrained and penalty function problems under discrete distributions, Using diversification, communication and parallelism to solve mixed-integer linear programs, Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs, PEBBL: an object-oriented framework for scalable parallel branch and bound, FiberSCIP—A Shared Memory Parallelization of SCIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A computational study of primal heuristics inside an MI(NL)P solver, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Decomposition-based inner- and outer-refinement algorithms for global optimization, Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing, A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-standard approaches to integer programming
- SCIP: solving constraint integer programs
- Towards a practical parallelisation of the simplex method
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Parallel depth first search. II: Analysis
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Recovering an optimal LP basis from an interior point solution
- A spectral bundle method with bounds
- The volume algorithm: Producing primal solutions with a subgradient method
- A parallel primal-dual simplex algorithm
- Branching rules revisited
- MIPLIB 2003
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- Early Estimates of the Size of Branch-and-Bound Trees
- Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs
- Computational Experience with a Software Framework for Parallel Integer Programming
- An Exact Rational Mixed-Integer Programming Solver
- On the Complexity of Selecting Disjunctions in Integer Programming
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Solving Real-World Linear Programs: A Decade and More of Progress
- On Finding Primal- and Dual-Optimal Bases
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- Parallelizing the Dual Simplex Method
- An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
- Detecting Orbitopal Symmetries
