Could we use a million cores to solve an integer program?
type: Item
instance of: scholarly article
title: Could we use a million cores to solve an integer program?
zbMATH Open document ID: 1262.90106
author: Thorsten Koch
author: Yuji Shinano
author: Ted K. Ralphs
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6137607
zbMATH Keywords: parallelization
describes a project that uses: SoPlex
describes a project that uses: MIPLIB
describes a project that uses: Concorde
describes a project that uses: CHiPPS
describes a project that uses: pPCx
describes a project that uses: Kendo
describes a project that uses: SCIP
describes a project that uses: QSopt_ex
describes a project that uses: ParaSCIP
describes a project that uses: MIPLIB2003
describes a project that uses: SDPARA
describes a project that uses: UG
describes a project that uses: GCG
MaRDI profile type: Publication
full work available at URL: s00186-012-0390-9
OpenAlex ID: W2054209364
cites work: Non-standard approaches to integer programming
cites work: SCIP: solving constraint integer programs
cites work: Branching rules revisited
cites work: MIPLIB 2003
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
cites work: Detecting Orbitopal Symmetries
cites work: Parallelizing the Dual Simplex Method
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
cites work: Recovering an optimal LP basis from an interior point solution
cites work: Q3525409
cites work: An Exact Rational Mixed-Integer Programming Solver
cites work: An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
cites work: Early estimates of the size of branch-and-bound trees
cites work: An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
cites work: Warm start of the primal-dual method applied in the cutting-plane scheme
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: Towards a practical parallelisation of the simplex method
cites work: A spectral bundle method with bounds
cites work: Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
cites work: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
cites work: A parallel primal-dual simplex algorithm
cites work: Parallel depth first search. II: Analysis
cites work: On the Complexity of Selecting Disjunctions in Integer Programming
cites work: On Finding Primal- and Dual-Optimal Bases
cites work: Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Q4254875
cites work: Q4346087
cites work: Computational experience with a software framework for parallel integer programming
cites work: Warm-start strategies in interior-point methods for linear programming
DOI: 10.1007/S00186-012-0390-9
description: scientific article; zbMATH DE number 6137607