A survey of very large-scale neighborhood search techniques
Top Cited Papers
- 15 November 2002
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 123 (1-3), 75-102
- https://doi.org/10.1016/s0166-218x(01)00338-9
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graphInformation Processing Letters, 1998
- Constructing efficient simulated annealing algorithmsDiscrete Applied Mathematics, 1997
- TSP ejection chainsDiscrete Applied Mathematics, 1997
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- Data Structures for Traveling SalesmenJournal of Algorithms, 1995
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)Journal of the Operational Research Society, 1990
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- A Procedure for Placement of Standard-Cell VLSI CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982