A neural model for the \(p\)-median problem
From MaRDI portal
Publication:2384886
DOI10.1016/j.cor.2006.03.005zbMath1141.90464MaRDI QIDQ2384886
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.005
Related Items
A Lagrangian heuristic algorithm for a public healthcare facility location problem, New models for commercial territory design, A branch and bound algorithm for determining locations of long-term care facilities, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, Solving the \(p\)-median problem on regular and lattice networks
Uses Software
Cites Work
- ``Neural computation of decisions in optimization problems
- A search tree algorithm for plant location problems
- A tree search algorithm for the p-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- Heuristic concentration: Two stage solution construction
- A dynamic programming heuristic for the \(P\)-median problem
- An efficient genetic algorithm for the \(p\)-median problem
- Application of decision analysis techniques to the Weber facility location problem
- A hybrid neural approach to combinatorial optimization
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Bounded Algorithm for the p-Median Problem
- Variable neighborhood search for the p-median
- Neural networks and physical systems with emergent collective computational abilities.
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
