A tabu search heuristic and adaptive memory procedure for political districting
type: Item
instance of: scholarly article
title: A tabu search heuristic and adaptive memory procedure for political districting
zbMATH Open document ID: 1037.90535
DOI: 10.1016/S0377-2217(01)00380-0
author: Erhan Erkut
author: G. Laporte
author: Burcin Bozkaya
published in: European Journal of Operational Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91D99
Mathematics Subject Classification ID: 91F10
zbMATH DE Number: 1902790
zbMATH Keywords: Political districting
zbMATH Keywords: multicriteria optimization
zbMATH Keywords: tabu search heuristic
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4365126
cites work: Designing and reporting on computational experiments with heuristic methods
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Combinatorial Optimization Problems with Soft and Hard Requirements
cites work: Solving a large scale districting problem: A case report
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4354785
cites work: Evaluation and Optimization of Electoral Systems
cites work: An optimization based heuristic for political districting
cites work: Metaheuristics: A bibliography
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Q4040780
description: scientific article; zbMATH DE number 1902790