Variable neighborhood search

Computers and Operations Research

Volumn 24, Issue 11, 1997, Pages 1097-1100

  Mladenovic N ^a   Hansen, P ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATIONS; COMBINATORIAL MATHEMATICS; EFFICIENCY; OPTIMIZATION;

SEARCH ALGORITHMS;

HEURISTIC PROGRAMMING;

EID: 0031281221     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00031-2     Document Type: Article

References (10)

1. Gendreau, M., Hertz, A. and Laporte, G., New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 1992, 40, 1086-1094.
2. Gendreau, M., Hertz, A. and Laporte, G., The traveling salesman problem with backhauls. Computers and Operations Research, 1996, 23, 501-508.
3. Reeves, C., ed., Modern Heuristic Techniques for Combinatorial Problems. Blackwells, Oxford, 1993.
4. Osman, I. H. and Laporte, G., Metaheuristics. A bibliography . Annals of Operational Research, 1996, 63, 513-628.
5. Glover, F., Tabu Search-Part I. ORSA Journal of Computing., 1989, 1, 190-206.
6. Glover, F., Tabu Search-Part II. ORSA Journal of Computing, 1990, 2, 4-32.
7. Hansen, P. and Jaumard, B., Algorithms for the maximum satisfiability problem. Computing, 1990, 44, 279-303.
8. Johnson, D. S. and McGeoch, L. A., The traveling salesman problem, a case study in local optimization. In Local search in combinatorial optimization, eds E.H.L. Aarts and J.K. Lenstra. Wiley, New York, 1997 (to appear).
9. Bentley, J. L., Fast algorithms for geometric traveling salesman problem. ORSA Journal of Computing, 1992, 4, 387-411.
10. Erlenkotter, D., A dual-based procedure for uncapacitated facility location. Operations Research, 1978, 26, 992-100911.