Large-scale local search heuristics for the capacitated vertex p-center problem

Networks

Volumn 43, Issue 4, 2004, Pages 241-255

  Scaparra, Maria Paola ^a   Pallottino, Stefano ^a   Scutellà, Maria Grazia ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Large scale optimization; Location problems; Multiexchange

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; RISK ASSESSMENT; SET THEORY;

LARGE-SCALE OPTIMIZATION; LOCATION PROBLEMS; MULTI-EXCHANGE;

PROBLEM SOLVING;

EID: 3042566958     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20000     Document Type: Article

References (14)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutellà, A multiexchange heuristic for the single source capacitated facility location problem, TR 02-11, Dipartimento di Informatica, Università di Pisa, 2002, Manage Sci, to appear.
3. R.K. Ahuja, J.B. Orlin, and D. Sharma, New neighborhood search structures for the capacitated minimum spanning tree problem, Math Program 91 (2001), 71-97.
4. J. Bar-Ilan, G. Kortsarz, and D. Peleg, How to allocate network centers, J Algorithms 15 (1993), 385-415.
5. J.E. Beasley, OR-Library: Distributing test problems by electronic mail, J Operat Res Soc 41 (1990), 1069-1072.
6. A. Frangioni, E. Necciari, and M.G. Scutellà, A multiexchange neighborhood for minimum makespan machine scheduling problems, TR 00-17, Dipartimento di Informatica, Università di Pisa, 2000, J Combinat Optimizat, to appear.
7. R.D. Galvão and C. ReVelle, A Lagrangean heuristic for the maximum covering location problem, Eur J Operat Res 88 (1996), 114-123.
8. D.S. Hochbaum and D. Shmoys, A unified approach to approximation algorithms for bottleneck problems, J ACM 33 (1986), 533-550.
9. M. Jaeger and J. Goldberg, A polynomial algorithm for the equal capacity p-center problem on trees, Transport Sci 28 (1994), 167-175.
10. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. Part 1: The p-centers, SIAM J Appl Math 37 (1979), 513-538.
11. S. Khuller and Y.J. Sussmann, The capacitated k-center problem, SIAM J Discrete Math 13 (2000), 403-418.
12. L.A.N. Lorena and E.L.F. Senne, A column generation approach to capacitated p-median problems, Comput Operat Res, 31 (2004), 863-876.
13. H.E. Romeijn and D. Romero Morales, A class of greedy algorithms for the generalized assignment problem, Discrete Appl Math 103 (2000), 209-235.
14. P.M. Thompson and H.N. Psaraftis, Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Operat Res 41 (1993), 935-946.