Solving net-constrained clustering problem

DOI10.23952/jnva.8.2024.6.09MaRDI QIDQ6668165

Julius Žilinskas, Mindaugas Kepalas

Publication date: 21 January 2025

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

zbMATH Keywords

non-convex constraintsk-means algorithmconstrained multi-source Weber problemcluster-center-location constraintsconstrained minimum-sum-of-squares clusteringlocation-allocation paradigm

Mathematics Subject Classification ID

Operator theory (47-XX) Functional analysis (46-XX)

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?)
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• An optimal method for solving the (generalized) multi-Weber problem
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• An Algorithm for a Constrained Weber Problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Heuristic Methods for Location-Allocation Problems
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Solving net-constrained clustering problem

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