Adaptive kernel search: a heuristic for solving mixed integer linear programs
From MaRDI portal
Publication:1694819
DOI10.1016/j.ejor.2017.06.005zbMath1380.90290OpenAlexW2624633283MaRDI QIDQ1694819
G. Guastaroba, Maria Grazia Speranza, Savelsbergh, Martin W. P.
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.06.005
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment, Order batching using an approximation for the distance travelled by pickers, A kernel search heuristic for a fair facility location problem, Optimal selection of touristic packages based on user preferences during sports mega-events, On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution, Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date, Matheuristics: survey and synthesis, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, A kernel search heuristic for the multivehicle inventory routing problem, A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model, Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem, Structure-driven fix-and-propagate heuristics for mixed integer programming, A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
Uses Software
Cites Work
- A heuristic for BILP problems: the single source capacitated facility location problem
- Using the analytic center in the feasibility pump
- Kernel search: a new heuristic framework for portfolio selection
- Kernel search: an application to the index tracking problem
- Boosting the feasibility pump
- Proximity search for 0--1 mixed-integer convex programming
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Restrict-and-relax search for 0-1 mixed-integer programs
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Feasibility pump 2.0
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local branching
- Solving zero-one mixed integer programming problems using tabu search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Pivot and shift -- a mixed integer programming heuristic
- Feasibility Pump-like heuristics for mixed integer problems
- Repairing MIP infeasibility through local branching
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- Parametric tabu-search for mixed integer programs
- The feasibility pump
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Octane: A New Heuristic for Pure 0–1 Programs
- New variable neighbourhood search based 0-1 MIP heuristics
