Progress in presolving for mixed integer programming
type: Item
instance of: scholarly article
title: Progress in presolving for mixed integer programming
zbMATH Open document ID: 1329.90089
author: Gerald Gamrath
author: Thorsten Koch
author: Matthias Miltenberger
author: Dieter Weninger
author: Alexander Martin
published in: Mathematical Programming Computation
publication date: 2016-01-15T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6530829
describes a project that uses: SoPlex
describes a project that uses: SCIP
describes a project that uses: MIPLIB
describes a project that uses: MIPLIB2003
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
full work available at URL: s12532-015-0083-5
OpenAlex ID: W2125506391
cites work: Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
cites work: Conflict analysis in mixed integer programming
cites work: SCIP: solving constraint integer programs
cites work: MIPLIB 2003
cites work: Presolving in linear programming
cites work: Conflict graphs in solving integer programming problems
cites work: Integer-programming software systems
cites work: Reducing the number of variables in integer and linear programming problems
cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point
cites work: A note on detecting simple redundancies in linear systems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Discrete-Variable Extremum Problems
cites work: Sorting and Selection in Posets
cites work: Computational Integer Programming and Cutting Planes
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Experiments in integer programming
cites work: Q4040221
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Supernode processing of mixed-integer models
cites work: The Elimination of Integer Variables
cites work: Q4254875
cites work: Q4346087
cites work: A note on reducing the number of variables in integer programming problems
DOI: 10.1007/S12532-015-0083-5
description: scientific article; zbMATH DE number 6530829