A Lagrangian treatment of certain nonlinear clustering problems

DOI10.1016/0377-2217(81)90273-3zbMath0452.90049OpenAlexW1979133430MaRDI QIDQ1148791

Larry E. Stanfel

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90273-3

zbMATH Keywords

set partitioningLagrange relaxationLagrangian treatmentlinear objective functioncollinear objectsnonlinear clustering problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (4)

A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints ⋮ A recursive Lagrangian method for clustering problems ⋮ Applications of the parametric programming procedure ⋮ A mathematical programming approach to clusterwise regression model and its extensions

Cites Work

• Unnamed Item
• Experiments with a very efficient heuristic for clustering problems
• Cluster analysis. A survey
• Cluster Analysis: An Application of Lagrangian Relaxation
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Integer Programming and the Theory of Grouping
• Optimal Sequential Partitions of Graphs
• Cluster Analysis and Mathematical Programming

This page was built for publication: A Lagrangian treatment of certain nonlinear clustering problems