Kohonen maps for solving a class of location-allocation problems
From MaRDI portal
Recommendations
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- A location-allocation model for siting high educational facilities
- Combined location-routing problems -- a neural network approach
- Neural networks for facility location problems
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
Cites work
- scientific article; zbMATH DE number 4204109 (Why is no real title available?)
- scientific article; zbMATH DE number 3976122 (Why is no real title available?)
- scientific article; zbMATH DE number 4047401 (Why is no real title available?)
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 53096 (Why is no real title available?)
- scientific article; zbMATH DE number 1253042 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 206006 (Why is no real title available?)
- A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks
- A comparative study of heuristics for a two-level routing-location problem
- A comparison of SOM neural network and hierarchical clustering methods
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- An Analysis of Private and Public Sector Location Models
- An efficient algorithm for the location-allocation problem with rectangular regions
- An optimal method for solving the (generalized) multi-Weber problem
- Cluster Analysis: An Application of Lagrangian Relaxation
- Easing the conscience of the guilty net
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Exact and approximate solutions to the multisource weber problem
- Heuristic Methods for Location-Allocation Problems
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Location-Allocation Problems
- Neural methods for the traveling salesman problem: Insights from operations research
- On computer sampling from trivariate and multivariate discrete distributions
- Properties and Solution Methods for Large Location-Allocation Problems
- Self-organization and associative memory
- Self-organization of neurons described by the maximum-entropy principle
- Self-organized formation of topologically correct feature maps
- Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- The Guilty net for the traveling salesman problem
Cited in
(8)- A location-allocation model for siting high educational facilities
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Multi-facility green Weber problem
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- On selection and composition in small area and mapping problems
- scientific article; zbMATH DE number 1376214 (Why is no real title available?)
- Combined location-routing problems -- a neural network approach
- Solving probabilistic multi-facility Weber problem by vector quantization
This page was built for publication: Kohonen maps for solving a class of location-allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296007)
