An exact algorithm for the capacitated vertex p-center problem

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1420-1436

  Özsoy, F Aykut ^a   Pinar, Mustafa Ç ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Capacitated p center problem; Facility location; Integer programming

Indexed keywords

COMPUTER SOFTWARE; INTEGER PROGRAMMING; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

BIN-PACKING; CAPACITATED P-CENTER PROBLEMS; FACILITY LOCATION;

ALGORITHMS;

EID: 26444572311     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.09.035     Document Type: Article

References (14)

1. Ilhan T, Pinar MÇ. An efficient exact algorithm for the vertex p -center problem, http://www.optimization-online.org/DB-HTML/2001/09/376.html, 2001.
2. O. Kariv, and S.L. Hakimi An algorithmic approach to network location problems part I the p -centers SIAM Journal of Applied Mathematics 37 1979 513 538
3. N. Mladenović, M. Labbé, and P. Hansen Solving the p -center problem with tabu search and variable neighborhood search Networks 42 2003 48 64
4. Elloumi S, Labbé M, Pochet Y. A new formulation and resolution method for the p -center problem. INFORMS Journal on Computing, 2001, to appear.
5. M.S. Daskin A new approach to solving the vertex p -center problem to optimality algorithm and computational results Communications of the Operations Research Society of Japan 45 2000 428 436
6. M.S. Daskin Network and discrete location 1995 Wiley New York
7. J. Bar-Ilan, G. Kortsarz, and D. Peleg How to allocate network centers Journal of Algorithms 15 1993 385 415
8. S. Khuller, and Y.J. Sussmann The capacitated K-center problem SIAM Journal on Discrete Mathematics 13 2000 403 418
9. M. Jaeger, and J. Goldberg A polynomial algorithm for the equal capacity p -center problem on trees Transportation Science 28 1994 167 175
10. S. Pallottino, M.P. Scappara, and M.G. Scutellà Large scale local search heuristics for the capacitated vertex p -center problem Networks 43 4 2002 241 255
11. Deng Q, Simchi-Levi D. Valid inequalities, facets and computational experience for the capacitated concentrator location problem. Rsearch report, Department of Industrial Engineering and Operations Research, Columbia University, New York, 1993.
12. S. Martello, and P. Toth Knapsack problems algorithms and implementations 1990 Wiley New York
13. J.E. Beasley A note on solving large p -median problems European Journal Operational Research 21 1985 270 273
14. L.A.N. Lorena, and E.L.F. Senne A column generation approach to capacitated p -median problems Computers and Operations Research 31 6 2004 863 876