On the set partitioning type formulation for the discrete location problem
Computers and Operations Research
Competitive location on a network
Operations Research
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Cluster analysis and mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Allocation of discrete demand with changing costs
Computers and Operations Research - location science
The Newton Bracketing Method for Convex Minimization
Computational Optimization and Applications
Directional Newton methods in n variables
Mathematics of Computation
Network transformation algorithm for supply chain plant location problem
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
Discrete Applied Mathematics
Engineering self-critical behavior in mobile adhoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Journal of Global Optimization
Expert Systems with Applications: An International Journal
A generalized Weiszfeld method for the multi-facility location problem
Operations Research Letters
Determining the number of facilities for large-scale emergency
International Journal of Computing Science and Mathematics
| Hi-index | 0.01 |
A heuristic method for solving large-scale multi-facility location problems is presented. The method is analogous to Cooper's method (SIAM Rev. 6 (1964) 37), using the authors' single facility location method (Comput. Optim. Appl. 21 (2002) 213) as a parallel subroutine, and reassigning customers to facilities using the heuristic of nearest center reclassification. Numerical results are reported.