Properties and Solution Methods for Large Location-Allocation Problems
From MaRDI portal
Cited in
(21)- The multiple-robot assembly plan problem
- Metaheuristic applications on discrete facility location problems: a survey
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Duality in constrained location problems
- Fifty years of location theory -- a selective review
- Allocation search methods for a generalized class of location-allocation problems
- Kohonen maps for solving a class of location-allocation problems
- A projection method for \(l_ p\) norm location-allocation problems
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Determining dominant wind directions
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Duality in constrained multi‐facility location models
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Contour approximation of data: a duality theory
- Location and layout planning. A survey
- A two-echelon joint continuous-discrete location model
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A new bounding method for single facility location models
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Location Science in Canada
- Solving probabilistic multi-facility Weber problem by vector quantization
This page was built for publication: Properties and Solution Methods for Large Location-Allocation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936462)
