Partial neighborhood local searches
From MaRDI portal
Publication:6082175
DOI10.1111/itor.12983OpenAlexW3157118427MaRDI QIDQ6082175
Sara Tari, Matthieu Basseur, Adrien Goëffon
Publication date: 29 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.12983
Cites Work
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- A survey on metaheuristics for stochastic combinatorial optimization
- QAPLIB - a quadratic assignment problem library
- Breakout local search for the quadratic assignment problem
- Benchmarks for basic scheduling problems
- First vs. best improvement: an empirical study
- Assignment Problems and the Location of Economic Activities
- P-Complete Approximation Problems
- Metaheuristics—the metaphor exposed
- Principles and Practice of Constraint Programming – CP 2004
- A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem
- A model‐based heuristic to the vehicle routing and loading problem
- Unnamed Item
- Unnamed Item
This page was built for publication: Partial neighborhood local searches
