Adaptive large neighborhood search for mixed integer programming
From MaRDI portal
Publication:2146445
DOI10.1007/s12532-021-00209-7zbMath1489.90067OpenAlexW2913657094MaRDI QIDQ2146445
Publication date: 16 June 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-021-00209-7
Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11)
Related Items
Local branching relaxation heuristics for integer linear programs, Online learning for scheduling MIP heuristics
Uses Software
Cites Work
- Unnamed Item
- Proximity search for 0--1 mixed-integer convex programming
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- SCIP: solving constraint integer programs
- RENS. The optimal rounding
- A general heuristic for vehicle routing problems
- Progress in presolving for mixed integer programming
- Feasibility pump 2.0
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Measuring the impact of primal heuristics
- Repairing MIP infeasibility through local branching
- MIPLIB 2003
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- An Automatic Method of Solving Discrete Programming Problems
- The Nonstochastic Multiarmed Bandit Problem
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- A Configuration Model for the Line Planning Problem
- DINS, a MIP Improvement Heuristic
- A tree-search algorithm for mixed integer programming problems
- Experiments in mixed-integer linear programming
- Finite-time analysis of the multiarmed bandit problem
