Progress in presolving for mixed integer programming

DOI10.1007/S12532-015-0083-5zbMath1329.90089OpenAlexW2125506391MaRDI QIDQ903920

Thorsten Koch, Dieter Weninger, Matthias Miltenberger, Gerald Gamrath, Alexander Martin

Publication date: 15 January 2016

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-015-0083-5

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (21)

Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Extended formulation for hop constrained distribution network configuration problems ⋮ A decomposition heuristic for mixed-integer supply chain problems ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ Optimal decision trees for the algorithm selection problem: integer programming based approaches ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Presolving linear bilevel optimization problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Three enhancements for optimization-based bound tightening ⋮ On Incremental Pre-processing for SMT ⋮ Preprocessing and cutting planes with conflict graphs ⋮ A combined variable aggregation presolving technique for mixed integer programming ⋮ Presolve Reductions in Mixed Integer Programming ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ An algorithm-independent measure of progress for linear constraint propagation

Uses Software

• SoPlex
• MIPLIB
• MIPLIB2003
• Algorithm 447
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• A note on detecting simple redundancies in linear systems
• SCIP: solving constraint integer programs
• Integer-programming software systems
• Experiments in integer programming
• Reducing the number of variables in integer and linear programming problems
• Supernode processing of mixed-integer models
• A note on reducing the number of variables in integer programming problems
• Presolving in linear programming
• Conflict graphs in solving integer programming problems
• MIPLIB 2003
• Conflict analysis in mixed integer programming
• Sorting and Selection in Posets
• Solving Large-Scale Zero-One Linear Programming Problems
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• The Elimination of Integer Variables
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
• Computational Integer Programming and Cutting Planes
• Discrete-Variable Extremum Problems

This page was built for publication: Progress in presolving for mixed integer programming