Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
From MaRDI portal
Publication:3369253
Recommendations
- Solving probabilistic multi-facility Weber problem by vector quantization
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- New heuristic methods for the capacitated multi-facility Weber problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- scientific article; zbMATH DE number 5282971
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- scientific article; zbMATH DE number 1560330
Cited in
(9)- A projection-type method for solving various Weber problems
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Solving probabilistic multi-facility Weber problem by vector quantization
- An agent-based framework for modeling and solving location problems
- A two-echelon joint continuous-discrete location model
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A Neural Heuristic For The Multisource Weber Problem
- scientific article; zbMATH DE number 5282971 (Why is no real title available?)
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
This page was built for publication: Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369253)