Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
From MaRDI portal
Publication:1427111
DOI10.1016/S0305-0548(03)00049-2zbMath1036.90042MaRDI QIDQ1427111
Kuang-Han Hsieh, Fang-Chih Tien
Publication date: 14 March 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (2)
Solving probabilistic multi-facility Weber problem by vector quantization ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Self-organized formation of topologically correct feature maps
- A comparison of SOM neural network and hierarchical clustering methods
- Kohonen maps for solving a class of location-allocation problems
- A projection method for \(l_ p\) norm location-allocation problems
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Location-Allocation Problems
- An efficient algorithm for the location-allocation problem with rectangular regions
- Properties and Solution Methods for Large Location-Allocation Problems
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Heuristic Methods for Location-Allocation Problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- The Transportation-Location Problem
- Exact and approximate solutions to the multisource weber problem
- Location Theory, Dominance, and Convexity
This page was built for publication: Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
