This is a preview of subscription content, log in via an institution to check access.
References
Bozkaya B., Erkut E. and Laporte G. (2003). A Tabu Search Heuristic and Adaptive Memory Procedure for Political Districting.European Journal of Operational Research 144, 12–26.
Bourjolly J.-M., Laporte G. and Rousseau J.-M. (1981). Découpage Électoral Automatisé: Application à l’Île de Montréal.INFOR 19, 113–124.
Forrest E. (1964). Apportionment by Computer.American Behavioral Scientist 23, 23–35.
Garfinkel R.S. (1968).Optimal Political Districting. PhD Thesis, The Johns Hopkins University, 1968. Also as working paper # 6812, Coll. of Bus. Admin., University of Rochester.
Haugland D., Ho S.C. and Laporte G. (2005). Designing Delivery District for the Vehicle Routing Problem with Stochastic Demands. Preprint.
Moscato P. and Cotta C. (2003). A Gentle Introduction to Memetic Algorithms. In: Glover F. and Kochenberger G.A. (eds.),Handbook of Metaheuristics. Kluwer, 105–144.
Rochat Y. and Taillard É.D. (1995). Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.Journal of Heuristics 1, 147–167.
Rights and permissions
About this article
Cite this article
G. Laporte. Top 13, 63–65 (2005). https://doi.org/10.1007/BF02578985
Issue Date:
DOI: https://doi.org/10.1007/BF02578985