Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
From MaRDI portal
Publication:6069740
DOI10.1111/itor.12643OpenAlexW2916319308WikidataQ128340568 ScholiaQ128340568MaRDI QIDQ6069740
Emanuela Guerriero, Emanuele Manni, Tommaso Adamo, Gianpaolo Ghiani
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12643
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- An ejection chain approach for the quadratic multiple knapsack problem
- Model-based automatic neighborhood design by unsupervised learning
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- An exact approach for the vertex coloring problem
- Constraint-based very large-scale neighborhood search
- Tuning metaheuristics. A machine learning Perspective
- Local branching
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- BPPLIB: a library for bin packing and cutting stock problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Vehicle routing problem with time windows and a limited number of vehicles.
- Models and bounds for two-dimensional level packing problems
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An ejection chain algorithm for the quadratic assignment problem
- Subgraph ejection chains and tabu search for the crew scheduling problem
- Exploring Hyper-heuristic Methodologies with Genetic Programming
- ParamILS: An Automatic Algorithm Configuration Framework
- Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
- On the generalized bin packing problem
- A learn‐and‐construct framework for general mixed‐integer programming problems
- A model‐based heuristic to the vehicle routing and loading problem
