On the capacitated concentrator location problem: A reformulation by discretization

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1242-1258

  Gouveia, Luís ^a   Saldanha Da Gama, Francisco ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Location; Model reformulation

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

LINEAR PROGRAMMING RELAXATION; MODEL REFORMULATION; OPTIMAL INTEGER SOLUTION;

LOCATION;

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

References (26)

1. K.R. Fox, B. Gavish, and S. Graves An n-constraint formulation of the (time-dependent) traveling salesman problem Operations Research 28 1980 1018 1021
2. J.-C. Picard, and M. Queyranne The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling Operations Research 26 1978 86 110
3. L. Gouveia, and S. Voß Classification of formulations for the (time-dependent) traveling salesman problem European Journal of Operational Research 83 1995 69 82
4. L. Gouveia A 2n constraint formulation for the capacitated minimal spanning tree problem Operations Research 43 1995 130 141
5. H. Pirkul Efficient algorithms for the capacitated concentrator location problem Computers and Operations Research 14 1987 197 208
6. M. Celani, R. Cerulli, M. Gaudioso, and Ya.D. Sergeyev A multiplier adjustment technique for the capacitated concentrator location problem Optimization Methods and Software 10 1998 87 102
7. K. Darby-Dowman, and H.S. Lewis Lagrangean relaxation and the single-source capacitated facility-location problem Journal of the Operational Research Society 39 1988 1035 1040
8. J. Barcelo, A. Hallefjord, E. Fernandez, and K. Jornsten Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing OR Spektrum 12 1990 79 88
9. J. Barcelo, E. Fernandez, and K. Jornsten Computational results from a new relaxation algorithm for the capacitated plant location problem European Journal of Operational Research 53 1991 38 45
10. K. Holmberg An exact algorithm for the capacitated facility location problems with single sourcing European Journal of Operational Research 113 1998 544 559
11. M.J. Cortinhal, and M.E. Captivo Upper and lower bounds for the single source capacitated location problem European Journal of Operational Research 151 2003 333 351
12. V.T. Raja, and B.T. Han An efficient heuristic for solving an extended capacitated concentrator location problem Telecommunication Systems 23 2003 171 199
13. V.J.M.F. Filho, and R.D. Galvão A tabu search heuristic for the concentrator location problem Location Science 6 1998 189 209
14. A. Migdalas, and S.C. Narula Concentrator location and terminal layout in local access networks-Integrated models Studies in Regional and Urban Planning 3 1994 199 214
15. Soltys JR, Fischer MJ, Roth BD, FTS2000 access optimisation. Presented at the 5th international conference on telecommunication systems, Nashville, 1997.
16. C. Yoo, and D. Tcha A cross decomposition procedure for the facility location problem with a choice of facility type Computers and Industrial Engineering 10 1986 190 283
17. K. Holmberg Solving the staircase cost facility location problem with decomposition and piecewise linearization European Journal of Operational Research 75 1994 41 61
18. K. Holmberg, and J. Ling A Lagrangean heuristic for the facility location problem with staircase costs European Journal of Operational Research 97 1997 63 74
19. I. Correia, and M.E. Captivo A Lagrangean heuristic for a modular capacitated location problem Annals of Operations Research 122 2003 141 161
20. Poliscastro S, Ukovich W. A modular plant location problem. Twelfth Euro Summer Institute, Tenerife, 1995.
21. A. Antunes, and D. Peeters On solving complex multi-period location models using simulated annealing European Journal of Operational Research 130 2001 190 201
22. S. Martello, and P. Toth Knapsack problems. Algorithms and computer implementations 1990 Wiley New York
23. T. Magnanti, P. Mirchandani, and R. Vachani Modeling and solving the two-facility capacitated network loading problem Operations Research 43 1995 142 157
24. K.L. Croxton, B. Gendron, and T.L. Magnanti A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems Management Science 49 2003 1268 1273
25. R. Sridharan The capacitated plant location problem European Journal of Operational Research 87 1995 203 213
26. A. Shulman An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes Operations Research 39 1991 423 436