Presolve Reductions in Mixed Integer Programming
type: Item
instance of: scholarly article
title: Presolve Reductions in Mixed Integer Programming
author: Tobias Achterberg
author: Zonghao Gu
author: Edward Rothberg
author: Dieter Weninger
author: Robert E. Bixby
published in: INFORMS Journal on Computing
publication date: 2021-01-07T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7290858
zbMATH Keywords: mixed integer programming
zbMATH Keywords: presolving
describes a project that uses: Chaff
describes a project that uses: SCIP
describes a project that uses: Gurobi
describes a project that uses: HASP
MaRDI profile type: Publication
full work available at URL: ijoc.2018.0857
OpenAlex ID: W2587095554
Wikidata QID: Q126837641
cites work: Conflict analysis in mixed integer programming
cites work: Q5241193
cites work: SCIP: solving constraint integer programs
cites work: Mixed Integer Programming: Analyzing 12 Years of Progress
cites work: Presolving in linear programming
cites work: Conflict graphs in solving integer programming problems
cites work: Integer-programming software systems
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q5465123
cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Discrete-Variable Extremum Problems
cites work: Computational Integer Programming and Cutting Planes
cites work: Progress in presolving for mixed integer programming
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: Degree-two Inequalities, Clique Facets, and Biperfect Graphs
cites work: Experiments in integer programming
cites work: Exploiting orbits in symmetric ILP
cites work: Symmetry in Integer Linear Programming
cites work: The elimination form of the inverse and its application to linear programming
cites work: Strong rank revealing LU factorizations
cites work: A computational comparison of symmetry handling methods for mixed integer programs
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: A finite algorithm for global minimization of separable concave programs
cites work: Supernode processing of mixed-integer models
cites work: Pivoting for Size and Sparsity in Linear Programming Inversion Routes
DOI: 10.1287/IJOC.2018.0857
description: scientific article