A view of local search in constraint programming
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 353-366
- https://doi.org/10.1007/3-540-61551-2_86
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Exchange Heuristic for Routeing Problems with Time WindowsJournal of the Operational Research Society, 1995
- An Optimal Algorithm for the Traveling Salesman Problem with Time WindowsOperations Research, 1995
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- New Insertion and Postoptimization Procedures for the Traveling Salesman ProblemOperations Research, 1992
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- Local search in routing problems with time windowsAnnals of Operations Research, 1985
- Optimization by Simulated AnnealingScience, 1983
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965