Local Search Heuristics for Capacitated p-Median Problems
Authors:
- 1 December 2003
- journal article
- Published by Springer Nature in Networks and Spatial Economics
- Vol. 3 (4) , 407-419
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lagrangean/Surrogate Heuristics for p-Median Problems2000
- An adaptive tabu search algorithm for the capacitated clustering problemInternational Transactions in Operational Research, 1999
- Lagrangean/surrogate relaxation for generalized assignment problemsEuropean Journal of Operational Research, 1999
- A Bionomic Approach to the Capacitated p-Median ProblemJournal of Heuristics, 1998
- Relaxation heuristics for a generalized assignment problemEuropean Journal of Operational Research, 1996
- A surrogate heuristic for set covering problemsEuropean Journal of Operational Research, 1994
- Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu SearchInternational Transactions in Operational Research, 1994
- Clustering algorithms for consolidation of customer orders into vehicle shipmentsTransportation Research Part B: Methodological, 1992
- Optimal clustering: A model and methodNaval Research Logistics (NRL), 1991
- Solving capacitated clustering problemsEuropean Journal of Operational Research, 1984