An efficient neural network algorithm for the p-median problem

DOI10.1007/3-540-36131-6_47MaRDI QIDQ4422160zbMATH OpenFDO

Authors Enrique Dominguez Merino, José Muñoz Pérez

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2527/25270460.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete location and assignment (90B80)

Recommendations

• A neural model for the p-median problem
• Large neighborhood search for the p-median problem
• The parallel variable neighborhood search for the p-median problem
• A fast novel algorithm for neural networks
• scientific article; zbMATH DE number 3915986
• A neural network for the minimum set covering problem
• Large neighborhood local search for the p-median problem
• scientific article; zbMATH DE number 4078838
• An efficient algorithm for the approximate median selection problem

Cited in

(4)

• A neural model for the p-median problem
• Neural networks for facility location problems
• A resonance neural network for the k-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches

This page was built for publication: An efficient neural network algorithm for the p-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422160)