Constraint-based very large-scale neighborhood search
From MaRDI portal
Publication:434452
DOI10.1007/s10601-011-9114-7zbMath1242.90104OpenAlexW2070778032MaRDI QIDQ434452
Yves Deville, Sébastien Mouthuy, Pascal Van Hentenryck
Publication date: 10 July 2012
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-011-9114-7
metaheuristicsconstraint satisfaction problemsconstraint-based local searchvery large-scale neighborhood
Related Items
Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
Cites Work
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- Contraint-based combinators for local search
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- The Travelling Salesman and the PQ-Tree
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Characterization and Automation of Matching-Based Neighborhoods
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
- New methods to color the vertices of a graph
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- New approaches for solving the block‐to‐train assignment problem
- Principles and Practice of Constraint Programming – CP 2004
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
