A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
From MaRDI portal
Publication:4680754
DOI10.1057/palgrave.jors.2601790zbMath1114.90396OpenAlexW2015523441MaRDI QIDQ4680754
Adam Prügel-Bennett, Celia A. Dr. Glass
Publication date: 7 June 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601790
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem ⋮ Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems ⋮ An efficient algorithm for computing the distance between close partitions ⋮ A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems ⋮ An improved ant colony optimisation heuristic for graph colouring ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ A search space ``cartography for guiding graph coloring heuristics
