1 |
Klose, A. and Drexl, A., (2005), Lower bounds for the capacitated facility location problem based on column generation, Management Science, 51(11), 1689-1705
DOI
ScienceOn
|
2 |
Sridharan R. (1995), The capacitated plant location problem, European Journal of Operational Research, 87 (2), 203-213
DOI
ScienceOn
|
3 |
Beasley, J. E. (1993), Lagrangian heuristics for location problems, European Journal of Operational Research, 65(3), 383-399
DOI
ScienceOn
|
4 |
Holmberg, K., Rönnqvist, M., and Yuan, D. (1999), An exact algorithm for the capacitated facility location problems with single sourcing, European Journal of Operational Research, 113(3), 544-559
DOI
ScienceOn
|
5 |
Arostegui, Jr., M. A., Kadipasaoglu, S. N., and Khumawala, B. M. (2006), An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems, International Journal of Production Economics, 103(2), 742-754
DOI
ScienceOn
|
6 |
Ahuja, R. K., Liu, J., Orlin, J. B., Goodstein, J., and Mukherjee, A. (2004). A neighborhood search algorithm for the combined through and fleet assignment model with time windows, Networks, 44(2), 160-171
DOI
ScienceOn
|
7 |
Cortinhal, M. J., Captivo, M. E. (2003), Upper and lower bounds for the single source capacitated location problem, European Journal of Operational Research, 151(2), 333-351
DOI
ScienceOn
|
8 |
Barahona, F., Anbil, R. (2000), The volume algorithm: Producing primal solutions with a subgradient method, Mathematical Programming, Series B 87(3), 385-399
DOI
ScienceOn
|
9 |
Pirkul, H. (1987), Efficient algorithms for capacitated concentrator location problem, computers and operations Research, 14(3), 197-208
DOI
ScienceOn
|
10 |
Barahona, F. and Chudak, F. A. (2005), Near-optimal solutions to large-scale facility location problems, Discrete Optimization, 2(1), 35-50
DOI
ScienceOn
|
11 |
Sridharan, R. (1993), A Lagrangian heuristic for the capacitatedplant location problem with single source constraints, European Journal of Operational Research, 66(3), 305-312
DOI
ScienceOn
|
12 |
Teitz, M. B. and Bart, P. (1968), Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research, 16(5), 955-961
DOI
ScienceOn
|
13 |
Aart, E. H. L. and Korst, J. H. M. (1991), Simulated annealing Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. John Wiley, Chichester
|
14 |
Lenstra, J. K., Rinnooy Kan, A. H. G. (1978), Complexity of scheduling under precedence constraints, Operations Research, 26(1), 22-35
DOI
ScienceOn
|
15 |
Korupolu, M. R., Plaxton, C. G., Rajaraman, R. (2000), Analysis of a local search heuristic for facility location problems, Journal of Algorithms, 37(1), 146-188
DOI
ScienceOn
|