A shortest-route approach for optimum aggregation of data with an application to income data

DOI10.1016/0305-0548(85)90047-4zbMath0606.90075OpenAlexW1983411197MaRDI QIDQ1085053

B. George

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(85)90047-4

zbMATH Keywords

shortest path algorithmgrouping a large volume of discrete data

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Operations research and management science (90B99)

Cites Work

• A note on two problems in connexion with graphs
• On Grouping for Maximum Homogeneity
• Integer Programming and the Theory of Grouping
• Cluster Analysis and Mathematical Programming

This page was built for publication: A shortest-route approach for optimum aggregation of data with an application to income data