A spanning tree heuristic for regional clustering

DOI10.1080/03610929508831512zbMath0825.62291OpenAlexW2119865296MaRDI QIDQ4843881

Maurizio Maravalle, Bruno Simeone

Publication date: 17 August 1995

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610929508831512

zbMATH Keywords

heuristicsgraphsspanning treescontiguity-constrained clusteringinertia minimizationregional districting

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (7)

An overview of graph covering and partitioning ⋮ Network-Based Dissolution ⋮ An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters ⋮ Clustering on trees ⋮ Tree partitioning under constraints. -- Clustering for vehicle routing problems ⋮ Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs ⋮ Network-Based Vertex Dissolution

Cites Work

• Solving capacitated clustering problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A spanning tree heuristic for regional clustering