TY  - JOUR
AU  - Singhtaun, Chansiri 
AU  - Charnsethikul, Peerayuth 
PY  - 2007
TI  - An Efficient Algorithm for Capacitated Multifacility Location Problems
JF  - Journal of Computer Science
VL  - 3
IS  - 8
DO  - 10.3844/jcssp.2007.583.591
UR  - https://thescipub.com/abstract/jcssp.2007.583.591
AB  - 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.