Minimization subproblems and heuristics for an applied clustering problem
From MaRDI portal
Publication:1869508
DOI10.1016/S0377-2217(02)00208-4zbMath1011.90040MaRDI QIDQ1869508
Ernesto G. Birgin, José Mario Martínez, Débora P. Ronconi
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid spectral gradient method for the unconstrained minimization problem, Generalized order-value optimization, Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Qualitative robustness for stochastic processes
- \(L_1\) cluster analysis
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
- Clusterwise linear regression
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Integrating robust clustering techniques in S-PLUS
- Preconditioned spectral gradient method
- A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- c-means clustering with the l/sub l/ and l/sub infinity / norms
- Improved clustering using deterministic annealing with a gradient descent technique
- Part-family formation for cellular manufacturing: A case study at Harnischfeger
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Automatic differentiation and spectral projected gradient methods for optimal control problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
