Very large-scale neighborhood search

International Transactions in Operational Research

Volumn 7, Issue 4-5, 2000, Pages 301-317

  Ahuja, R K ^a   Orlin, J B ^b   Sharma, D ^c  

^a University of Florida   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Capacitated minimum spanning tree; Heuristics; Neighborhood search algorithms; Network design; Spanning tree; Tabu search; Telecommunications

Indexed keywords

EID: 13444294601     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2000.tb00201.x     Document Type: Article

References (16)

1. Aarts, E., Lenstra, J.K., 1997. Local Search in Combinatorial Optimization. Wiley, New York.
2. Ahuja, R.K., Orlin, J.B., Sharma, D., 2000. New neighborhood search structures for the capacitated minimum spanning tree problem. Working Paper, Sloan School of Management, MIT, Cambridge, MA, Mathematical Programming, submitted.
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, NJ.
4. Amberg, A., Domschke, W., VoB, S., 1996. Capacitated minimum spanning trees: algorithms using intelligent search. Combinatorial Optimization: Theory and Practice 1, 9-39.
5. Feo, T.A., Resende, M.G.C., 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-125.
6. Gavish, B., 1991. Topological design of telecommunications networks: local access design methods. Annals of Operations Research 33, 17-71.
7. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Norwell, MA.
8. Johnson, E.L., Mehrotra, A., Nemhauser, G.L., 1993. Min-cut clustering. Mathematical Programming 62, 133-152.
9. Kirkpatrick, S., Gelatt Jr, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680.
10. Labbe, M., Louveaux, F.V., 1997. Location problems. In: Amico, M. Dell, Maffioli, F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley, New York, pp. 261-282.
11. Laporte, G., 1997. Vehicle routing. In: Amico, M. Dell, Maffioli, F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley, New York.
12. Pinedo, M., 1995. Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, NJ.
13. Savelsbergh, M., 1998. A branch and price algorithm for the generalized assignment problem. Operations Research 45, 831-841.
14. Sharaiha, Y.M., Gendreau, M., Laporte, G., Osman, I.H., 1997. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29, 161-171.
15. Thompson, P.M., Orlin, J.B., 1989. The Theory of Cyclic Transfers. Working Paper No. OR 200-89, Operations Research Center, MIT, Cambridge, MA.
16. Thompson, P.M., Psaraftis, H.N., 1993. Cyclic transfer algorithms for multi vehicle routing and scheduling problems. Operations Research 41, 935-946.