scientific article; zbMATH DE number 1247176

MaRDI QIDQ4226739zbMATH OpenFDO

Authors Lixin Tang, Zihou Yang, Mengguang Wang

Publication date 2 February 1999

zbMATH Keywords

0-1 integer programming\(P\)-median modelclusteringcomputational performanceinequality constraintsLagrangean heuristic algorithmLagrangean relaxationnumerical examples

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99) Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Recommendations

• An aggregation heuristic for large scale p-median problem
• Solving capacitated clustering problems
• A Lagrangian search method for the \(P\)-median problem
• Optimal partitioning of a data set based on the \(p\)-median model
• Relajacion lagrangeana para el problema de particionamiento de áreas geográficas

Cited in

(8)

• A Lagrangian search method for the \(P\)-median problem
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
• An aggregation heuristic for large scale p-median problem
• Improving spectral bounds for clustering problems by Lagrangian relaxation
• scientific article; zbMATH DE number 7378621 (Why is no real title available?)
• A parallelized lagrangean relaxation approach for the discrete ordered median problem
• Density based problem space search for the capacitated clustering p-median problem
• Optimal partitioning of a data set based on the \(p\)-median model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226739)