Exportar Publicação
A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.
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
M. J. Cortinhal and M. E. Captivo, "Upper and lower bounds for the single source capacitated location problem", in European Journal of Operational Research , vol. 151, no. 2, pp. 333-351, 2003
@article{cortinhal2003_1732202881669, author = "Cortinhal, M. J. and Captivo, M. E.", title = "Upper and lower bounds for the single source capacitated location problem", journal = "European Journal of Operational Research ", year = "2003", volume = "151", number = "2", doi = "10.1016/S0377-2217(02)00829-9", pages = "333-351", url = "https://www.sciencedirect.com/science/article/pii/S0377221702008299?via%3Dihub" }
TY - JOUR TI - Upper and lower bounds for the single source capacitated location problem T2 - European Journal of Operational Research VL - 151 IS - 2 AU - Cortinhal, M. J. AU - Captivo, M. E. PY - 2003 SP - 333-351 SN - 0377-2217 DO - 10.1016/S0377-2217(02)00829-9 UR - https://www.sciencedirect.com/science/article/pii/S0377221702008299?via%3Dihub AB - The single source capacitated location problem is considered. Given a set of potential locations and the plant capacities, it must be decided where and how many plants must be open and which clients must be assigned to each open plant. A Lagrangean relaxation is used to obtain lower bounds for this problem. Upper bounds are given by Lagrangean heuristics followed by search methods and by one tabu search metaheuristic. Computational experiments on different sets of problems are presented. ER -