@article {10.3844/jcssp.2007.583.591,
article_type = {journal},
title = {An Efficient Algorithm for Capacitated Multifacility Location Problems},
author = {Singhtaun, Chansiri and Charnsethikul, Peerayuth},
volume = {3},
number = {8},
year = {2007},
month = {Aug},
pages = {583-591},
doi = {10.3844/jcssp.2007.583.591},
url = {https://thescipub.com/abstract/jcssp.2007.583.591},
abstract = {In this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques is developed. The numerical experiments are randomly generated to test efficiency of the proposed algorithm compared with a linearization algorithm. The results show that the proposed algorithm provides a better solution   on average with less processing time for all various sizes of problems.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}