Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases
From MaRDI portal
Publication:2572249
DOI10.1016/J.EJOR.2004.05.027zbMATH Open1085.90007OpenAlexW2014369272MaRDI QIDQ2572249FDOQ2572249
Authors: 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
Recommendations
- A genetic algorithm for the \(p\)-median problem with pos/neg weights
- Variable neighborhood search for the p-median
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
Cites Work
- A note on solving large p-median problems
- Title not available (Why is that?)
- An efficient tabu search procedure for the \(p\)-median problem
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Variable neighborhood search: Principles and applications
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Variable neighborhood search for the p-median
- 2-medians in trees with pos/neg weights
Cited In (18)
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- Solving the unconstrained optimization problem by a variable neighborhood search
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search for the p-median
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Variable neighbourhood search: methods and applications
- A revised variable neighborhood search for the discrete ordered median problem
- Variable neighborhood search for location routing
- A Lagrangian search method for the \(P\)-median problem
- Variable neighbourhood structures for cycle location problems
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
- A branch and bound algorithm for determining locations of long-term care facilities
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights
- The multi-facility median problem with Pos/Neg weights on general graphs
- An effective VNS for the capacitated \(p\)-median problem
- A genetic algorithm for the \(p\)-median problem with pos/neg weights
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572249)
