Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases

DOI10.1016/j.ejor.2004.05.027zbMath1085.90007OpenAlexW2014369272MaRDI QIDQ2572249

Jafar Fathali, Hossein Taghizadeh Kakhki

Publication date: 16 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.05.027

zbMATH Keywords

networks\(p\)-median problemtabu search procedure

Mathematics Subject Classification ID

Search theory (90B40) Deterministic network models in operations research (90B10)

Related Items (15)

Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search ⋮ Variable neighborhood search for location routing ⋮ Solving the unconstrained optimization problem by a variable neighborhood search ⋮ A genetic algorithm for the \(p\)-median problem with pos/neg weights ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ The multi-facility median problem with Pos/Neg weights on general graphs ⋮ Variable neighbourhood structures for cycle location problems ⋮ A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights ⋮ An effective VNS for the capacitated \(p\)-median problem ⋮ An ant colony algorithm for the pos/neg weighted \(p\)-median problem ⋮ Variable neighbourhood search: methods and applications ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• OR-Library

Cites Work

• A note on solving large p-median problems
• An efficient tabu search procedure for the \(p\)-median problem
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• 2-medians in trees with pos/neg weights
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases