Adaptive large neighborhood search for mixed integer programming
From MaRDI portal
Recommendations
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- A survey of adaptive large neighborhood search algorithms and applications
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- Revisiting the self-adaptive large neighborhood search
- scientific article; zbMATH DE number 1664847
Cites work
- A configuration model for the line planning problem
- A general heuristic for vehicle routing problems
- A tree-search algorithm for mixed integer programming problems
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- An Automatic Method of Solving Discrete Programming Problems
- An evolutionary algorithm for polishing mixed integer programming solutions
- DINS, a MIP Improvement Heuristic
- Experiments in mixed-integer linear programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- Finite-time analysis of the multiarmed bandit problem
- Local branching
- Measuring the impact of primal heuristics
- MIPLIB 2003
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Progress in presolving for mixed integer programming
- Proximity search for 0--1 mixed-integer convex programming
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Reinforcement learning. An introduction
- RENS. The optimal rounding
- Repairing MIP infeasibility through local branching
- Rounding and propagation heuristics for mixed integer programming
- SCIP: solving constraint integer programs
- The Nonstochastic Multiarmed Bandit Problem
Cited in
(20)- Revisiting the self-adaptive large neighborhood search
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- A comparative analysis of two matheuristics by means of merged local optima networks
- Model-based automatic neighborhood design by unsupervised learning
- DINS, a MIP Improvement Heuristic
- Local branching relaxation heuristics for integer linear programs
- Online learning for scheduling MIP heuristics
- Adaptive cut selection in mixed-integer linear programming
- Learning to optimize: a tutorial for continuous and mixed-integer optimization
- One-shot learning for MIPs with SOS1 constraints
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Multi-task representation learning for mixed integer linear programming
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- Decision-focused neural adaptive search and diving for optimizing mining complexes
- A fix-propagate-repair heuristic for mixed integer programming
- Large neighborhood and hybrid genetic search for inventory routing problems
- Machine learning augmented branch and bound for mixed integer linear programming
- Principles for the design of large neighborhood search
Describes a project that uses
Uses Software
This page was built for publication: Adaptive large neighborhood search for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146445)
