Could we use a million cores to solve an integer program?
From MaRDI portal
Publication:1935943
Recommendations
- A parallel integer linear programming algorithm
- Computational experience with a software framework for parallel integer programming
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
- scientific article; zbMATH DE number 1206103
- Using diversification, communication and parallelism to solve mixed-integer linear programs
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A bundle method for integrated multi-depot vehicle and duty scheduling in public transit
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A parallel primal-dual simplex algorithm
- A spectral bundle method with bounds
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An exact rational mixed-integer programming solver
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- Branching rules revisited
- Computational experience with a software framework for parallel integer programming
- Detecting orbitopal symmetries
- Early estimates of the size of branch-and-bound trees
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- MIPLIB 2003
- Non-standard approaches to integer programming
- On Finding Primal- and Dual-Optimal Bases
- On the complexity of selecting disjunctions in integer programming
- Parallel depth first search. II: Analysis
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Parallelizing the Dual Simplex Method
- Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
- Recovering an optimal LP basis from an interior point solution
- SCIP: solving constraint integer programs
- Solving Real-World Linear Programs: A Decade and More of Progress
- The volume algorithm: Producing primal solutions with a subgradient method
- Towards a practical parallelisation of the simplex method
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Warm-start strategies in interior-point methods for linear programming
Cited in
(14)- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- SelfSplit parallelization for mixed-integer linear programming
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- 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
- On relations between chance constrained and penalty function problems under discrete distributions
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- FiberSCIP—A Shared Memory Parallelization of SCIP
- 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
- PEBBL: an object-oriented framework for scalable parallel branch and bound
Describes a project that uses
Uses Software
This page was built for publication: Could we use a million cores to solve an integer program?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935943)
