MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
From MaRDI portal
Publication:1652297
DOI10.1016/j.cor.2017.01.021zbMath1458.90641OpenAlexW2587562419MaRDI QIDQ1652297
Gianpaolo Ghiani, Emanuela Guerriero, Antonio Grieco, Emanuele Manni, Tommaso Adamo
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.01.021
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
A learn‐and‐construct framework for general mixed‐integer programming problems ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
Uses Software
Cites Work
- Unnamed Item
- Model-based automatic neighborhood design by unsupervised learning
- Kernel search: a new heuristic framework for portfolio selection
- Constraint-based very large-scale neighborhood search
- Kernel search: an application to the index tracking problem
- Bounding, filtering and diversification in CP-based local branching
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Tuning metaheuristics. A machine learning Perspective
- Feasibility pump 2.0
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Local branching
- Measuring instance difficulty for combinatorial optimization problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- The feasibility pump
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Exploring Hyper-heuristic Methodologies with Genetic Programming
- TSPLIB—A Traveling Salesman Problem Library
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
This page was built for publication: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
