Two-row and two-column mixed-integer presolve using hashing-based pairing methods
From MaRDI portal
Publication:2219510
DOI10.1007/s13675-020-00129-6zbMath1452.90215OpenAlexW3081419633MaRDI QIDQ2219510
Patrick Gemander, Ambros M. Gleixner, Alexander Martin, Dieter Weninger, Wei-Kun Chen, Leona Gottwald
Publication date: 20 January 2021
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-020-00129-6
Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Parallel numerical computation (65Y05)
Related Items
Efficient presolving methods for solving maximal covering and partial set covering location problems, Presolving linear bilevel optimization problems
Uses Software
Cites Work
- Unnamed Item
- 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
- Integer-programming software systems
- Progress in presolving for mixed integer programming
- Constraint propagation with interval labels
- Experiments in integer programming
- Supernode processing of mixed-integer models
- A finite algorithm for global minimization of separable concave programs
- Presolving in linear programming
- A decomposition heuristic for mixed-integer supply chain problems
- Bound reduction using pairs of linear inequalities
- On intersection of two mixing sets with applications to joint chance-constrained programs
- Feasibility-Based Bounds Tightening via Fixed Points
- Presolve Reductions in Mixed Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- An Algorithm for Large Zero-One Knapsack Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- The Multiple-Choice Knapsack Problem
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Discrete-Variable Extremum Problems
