Heuristic cluster algorithm for multiple facility location-allocation problem
From MaRDI portal
Publication:3348692
Recommendations
- Solving multiple facilities location problems with separated clusters
- Heuristic methods for large centroid clustering problems
- A heuristic method for large-scale multi-facility location problems
- Heuristic Methods for Location-Allocation Problems
- A dynamic programming heuristic for the \(P\)-median problem
Cited in
(15)- A location-allocation model for siting high educational facilities
- Affinity propagation and uncapacitated facility location problems
- New local searches for solving the multi-source Weber problem
- A heuristic method for large-scale multi-facility location problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- A two-echelon joint continuous-discrete location model
- Discrete facility location in machine learning
- Heuristic Methods for Location-Allocation Problems
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- Solving multiple facilities location problems with separated clusters
- Kohonen maps for solving a class of location-allocation problems
- A quadtree-based allocation method for a class of large discrete Euclidean location problems
- Heuristic approach for balanced allocation problem in logistics: a comparative study
This page was built for publication: Heuristic cluster algorithm for multiple facility location-allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348692)