Mixed integer programming: analyzing 12 years of progress
From MaRDI portal
Recommendations
Cited in
(92)- SelfSplit parallelization for mixed-integer linear programming
- An abstract model for branching and its application to mixed integer programming
- Domain reduction techniques for global NLP and MINLP optimization
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Light robustness in the optimization of Markov decision processes with uncertain parameters
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
- Preprocessing and cutting planes with conflict graphs
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Computational aspects of infeasibility analysis in mixed integer programming
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches
- An algorithm-independent measure of progress for linear constraint propagation
- On generalized surrogate duality in mixed-integer nonlinear programming
- A disjunctive cut strengthening technique for convex MINLP
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- An abstract model for branch-and-cut
- Learning pseudo-backdoors for mixed integer programs
- Partial hyperplane activation for generalized intersection cuts
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Evolutionary approach for large-scale mine scheduling
- Improving branch-and-cut performance by random sampling
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators
- Characterization of the split closure via geometric lifting
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Presolve Reductions in Mixed Integer Programming
- Mixed integer programming computation
- Parallelization of the FICO Xpress-Optimizer
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- Conflict Analysis for MINLP
- Conflict-Driven Heuristics for Mixed Integer Programming
- On generalized surrogate duality in mixed-integer nonlinear programming
- Stochastic Cutting Planes for Data-Driven Optimization
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
- Mixed-integer convex representability
- An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Estimating the Size of Branch-and-Bound Trees
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Relational linear programming
- Learning in combinatorial optimization: what and how to explore
- Three enhancements for optimization-based bound tightening
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
- On the geometry of symmetry breaking inequalities
- A computational status update for exact rational mixed integer programming
- On the geometry of symmetry breaking inequalities
- A computational status update for exact rational mixed integer programming
- Comments on: ``On learning and branching: a survey
- Cutting plane selection with analytic centers and multiregression
- Local branching relaxation heuristics for integer linear programs
- Learning sparse nonlinear dynamics via mixed-integer optimization
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
- Lifting for the integer knapsack cover polyhedron
- A data driven Dantzig-Wolfe decomposition framework
- A constraint programming approach for the premarshalling problem
- Progress in mathematical programming solvers from 2001 to 2020
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Adaptive cut selection in mixed-integer linear programming
- 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
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Certified dominance and symmetry breaking for combinatorial optimisation
- Decomposition methods for global solution of mixed-integer linear programs
- Certified Core-Guided MaxSAT Solving
- A combined variable aggregation presolving technique for mixed integer programming
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Enhancing cut selection through reinforcement learning
- An abstract model for branch and cut
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- A computational study of primal heuristics inside an MI(NL)P solver
- Generalized coefficient strengthening cuts for mixed integer programming
- Fifty years of power systems optimization
- Solving continuous and discrete nonlinear programs with BARON
- Data-driven parameterization refinement for the structural optimization of cruise ship hulls
- LLMs for cold-start cutting plane separator configuration
- Learning to use local cuts
- Local-MIP: efficient local search for mixed integer programming
- Maximum number of power unit state changes in selecting the composition of equipment
- Last fifty years of integer linear programming: a focus on recent practical advances
- A fix-propagate-repair heuristic for mixed integer programming
- A review of multi-objective optimization methods for personnel rostering problems
- 50 years of mixed-integer nonlinear and disjunctive programming
- Machine learning augmented branch and bound for mixed integer linear programming
- Graph convolutional branch and bound
- A parallel branch-and-bound-and-check algorithm for nesting
- Knapsack polytopes: a survey
This page was built for publication: Mixed integer programming: analyzing 12 years of progress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265181)
