Presolve Reductions in Mixed Integer Programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- A computational comparison of symmetry handling methods for mixed integer programs
- A finite algorithm for global minimization of separable concave programs
- An Algorithm for Large Zero-One Knapsack Problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computational Integer Programming and Cutting Planes
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Discrete-variable extremum problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Experiments in integer programming
- Exploiting orbits in symmetric ILP
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Integer-programming software systems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Mixed integer programming: analyzing 12 years of progress
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolving in linear programming
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Progress in presolving for mixed integer programming
- SCIP: solving constraint integer programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Strong rank revealing LU factorizations
- Supernode processing of mixed-integer models
- Symmetry in integer linear programming
- The elimination form of the inverse and its application to linear programming
Cited in
(58)- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Incorporating bounds from decision diagrams into integer programming
- Generalized coefficient strengthening cuts for mixed integer programming
- Maximum number of power unit state changes in selecting the composition of equipment
- Computational aspects of infeasibility analysis in mixed integer programming
- An algorithm-independent measure of progress for linear constraint propagation
- A combined variable aggregation presolving technique for mixed integer programming
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Speeding up the solution of the site and power assignment problem in wireless networks
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- A feasible rounding approach for mixed-integer optimization problems
- Last fifty years of integer linear programming: a focus on recent practical advances
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Enabling research through the SCIP Optimization Suite 8.0
- Efficient presolving methods for the influence maximization problem
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems
- Strong IP formulations need large coefficients
- On data reduction for dynamic vector bin packing
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption
- Search-space reduction via essential vertices
- Application of mixed integer quadratic program to shortest vector problems
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Adaptive cut selection in mixed-integer linear programming
- Symmetry detection in mixed-integer conic programming
- 50 years of mixed-integer nonlinear and disjunctive programming
- Cruise itineraries optimal scheduling
- On tackling reverse convex constraints for non-overlapping of unequal circles
- A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
- A computational status update for exact rational mixed integer programming
- Convex mixed-integer optimization with Frank-Wolfe methods
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- Transferring information across restarts in MIP
- A computational status update for exact rational mixed integer programming
- Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
- Automatically improving constraint models in Savile Row
- A flexible mathematical model for home health care problems
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Solving continuous and discrete nonlinear programs with BARON
- Implied integrality in mixed-integer optimization
- (Near)-optimal algorithms for sparse separable convex integer programs
- A combined linear and nonlinear presolve for nonlinear optimization
- Faster exact solution of sparse maxcut and QUBO problems
- On Incremental Pre-processing for SMT
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Presolving linear bilevel optimization problems
- Acquiring and selecting implied constraints with an application to the BinSeq and partition global constraints
- Learning to use local cuts
- Domain reduction techniques for global NLP and MINLP optimization
- Worst-case analysis of clique MIPs
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- P<scp>a</scp>PILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support
This page was built for publication: Presolve Reductions in Mixed Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386778)
