Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Continuous multifacility ordered median location problems
Using a conic formulation for finding Steiner minimal trees
Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
An improved column generation algorithm for minimum sum-of-squares clustering
Modified global $k$-means algorithm for minimum sum-of-squares clustering problems
NP-hardness of Euclidean sum-of-squares clustering
Cluster analysis and mathematical programming
Weber's problem with attraction and repulsion under polyhedral gauges
Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $\mathbb{R}^d$
Numerical methods for fuzzy clustering
The hyperbolic smoothing clustering method
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
Link-Length Minimization in Networks
Approximating K‐means‐type Clustering via Semidefinite Programming
Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$

This page was built for publication: Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem

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