Primal and dual bounds for the vertex p-median problem with balance constraints
- 27 June 2016
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 258 (2) , 613-638
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A dual bounding scheme for a territory design problemComputers & Operations Research, 2014
- An effective VNS for the capacitated p-median problemEuropean Journal of Operational Research, 2008
- A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting PlanesJournal of Mathematical Modelling and Algorithms, 2007
- Hybrid scatter search and path relinking for the capacitated p-median problemEuropean Journal of Operational Research, 2006
- A branch‐and‐price algorithm for the capacitated p‐median problemNetworks, 2005
- Density Based Problem Space Search for the Capacitated Clustering p-Median ProblemAnnals of Operations Research, 2004
- A Simulated Annealing Genetic Algorithm for the Electrical Power Districting ProblemAnnals of Operations Research, 2003
- A tabu search heuristic and adaptive memory procedure for political districtingEuropean Journal of Operational Research, 2003
- A simulated annealing approach to police district designComputers & Operations Research, 2002
- Optimal political districtingComputers & Operations Research, 1996