Pages that link to "Item:Q3386778"
From MaRDI portal
The following pages link to Presolve Reductions in Mixed Integer Programming (Q3386778):
Displaying 40 items.
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Cruise itineraries optimal scheduling (Q2037892) (← links)
- On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Application of mixed integer quadratic program to shortest vector problems (Q3121492) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Adaptive cut selection in mixed-integer linear programming (Q6168887) (← links)
- Presolving linear bilevel optimization problems (Q6169995) (← links)
- Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems (Q6175620) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications (Q6180277) (← links)
- A combined variable aggregation presolving technique for mixed integer programming (Q6564293) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
- Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption (Q6606604) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
