Presolve Reductions in Mixed Integer Programming
From MaRDI portal
Publication:3386778
DOI10.1287/ijoc.2018.0857OpenAlexW2587095554WikidataQ126837641 ScholiaQ126837641MaRDI QIDQ3386778
Zonghao Gu, Dieter Weninger, Tobias Achterberg, Edward Rothberg, Robert E. Bixby
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0857
Related Items
Incorporating bounds from decision diagrams into integer programming, Transferring information across restarts in MIP, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, Automatically improving constraint models in Savile Row, Preprocessing to reduce the search space: antler structures for feedback vertex set, On data reduction for dynamic vector bin packing, A feasible rounding approach for mixed-integer optimization problems, Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs, Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Faster exact solution of sparse maxcut and QUBO problems, Efficient presolving methods for the influence maximization problem, Efficient presolving methods for solving maximal covering and partial set covering location problems, Adaptive cut selection in mixed-integer linear programming, Presolving linear bilevel optimization problems, Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems, A branch and bound algorithm for robust binary optimization with budget uncertainty, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Domain reduction techniques for global NLP and MINLP optimization, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs, Generalized coefficient strengthening cuts for mixed integer programming, Strong IP formulations need large coefficients, Cruise itineraries optimal scheduling, A computational status update for exact rational mixed integer programming, On tackling reverse convex constraints for non-overlapping of unequal circles, Structure-driven fix-and-propagate heuristics for mixed integer programming, A computational status update for exact rational mixed integer programming, SAT encodings for pseudo-Boolean constraints together with at-most-one constraints, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Computational aspects of infeasibility analysis in mixed integer programming, Application of mixed integer quadratic program to shortest vector problems, Worst-case analysis of clique MIPs, An algorithm-independent measure of progress for linear constraint propagation, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- SCIP: solving constraint integer programs
- Integer-programming software systems
- Progress in presolving for mixed integer programming
- Experiments in integer programming
- Supernode processing of mixed-integer models
- A finite algorithm for global minimization of separable concave programs
- Exploiting orbits in symmetric ILP
- A computational comparison of symmetry handling methods for mixed integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Strong rank revealing LU factorizations
- Presolving in linear programming
- Conflict graphs in solving integer programming problems
- Conflict analysis in mixed integer programming
- Edmonds polytopes and a hierarchy of combinatorial problems
- The Elimination form of the Inverse and its Application to Linear Programming
- Symmetry in Integer Linear Programming
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- 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
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Computational Integer Programming and Cutting Planes
- Discrete-Variable Extremum Problems
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
