Solving net-constrained clustering problem

DOI10.23952/JNVA.8.2024.6.09MaRDI QIDQ6668165zbMATH OpenFDO

Authors Mindaugas Kepalas, Julius Žilinskas

Publication date 21 January 2025

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

Full work available at URL https://doi.org/10.23952/JNVA.8.2024.6.09

zbMATH Keywords

cluster-center-location constraintsconstrained minimum-sum-of-squares clusteringconstrained multi-source Weber problemk-means algorithmlocation-allocation paradigmnon-convex constraints

Mathematics Subject Classification ID

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

Cites work

• 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
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• An optimal method for solving the (generalized) multi-Weber problem
• Approximating K‐means‐type Clustering via Semidefinite Programming
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
• Heuristic Methods for Location-Allocation Problems
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1855792 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering

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)