Discrete facility location in machine learning

DOI10.33048/daio.2021.28.714zbMath1496.68282OpenAlexW4205333036MaRDI QIDQ5100135

Anton Vladimirovich Ushakov, Igor' Leonidovich Vasilyev

Publication date: 29 August 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da1284

zbMATH Keywords

clusteringfacility locationmachine learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Discrete location and assignment (90B80)

Uses Software

• apcluster
• APCluster
• ElemStatLearn
• AS 136
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Algorithm AS 136: A K-Means Clustering Algorithm
• A mixed integer linear model for clustering with variable selection
• The planar \(k\)-means problem is NP-hard
• A parallelized lagrangean relaxation approach for the discrete ordered median problem
• Model-based capacitated clustering with posterior regularization
• Solving capacitated clustering problems
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
• Recovery guarantees for exemplar-based clustering
• Discrete facility location with nonlinear diseconomies in fixed costs
• Complexity of local search for the \(p\)-median problem
• NP-hardness of Euclidean sum-of-squares clustering
• COBRA: A new formulation of the classic \(p\)-median location problem
• A column generation approach to capacitated \(p\)-median problems
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
• A computational study of a nonlinear minsum facility location problem
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• An aggregation heuristic for large scale p-median problem
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• The parallel variable neighborhood search for the \(p\)-median problem
• A constant-factor approximation algorithm for the \(k\)-median problem
• Polyhedral study of simple plant location problem with order
• The double-assignment plant location problem with co-location
• Near-optimal large-scale k-medoids clustering
• Near-optimal clustering in the \(k\)-machine model
• A tighter formulation of the \(p\)-median problem
• BEAMR: an exact and approximate model for the \(p\)-median problem
• A fast swap-based local search procedure for location problems
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• The capacitated centred clustering problem
• A strengthened formulation for the simple plant location problem with order
• A matheuristic for large-scale capacitated clustering
• Solving Large p-Median Problems with a Radius Formulation
• Relax, No Need to Round
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Cluster Analysis: An Application of Lagrangian Relaxation
• On the Complexity of Some Common Geometric Location Problems
• Solution methods for thep-median problem: An annotated bibliography
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• The Maximum Coverage Location Problem
• Location-Allocation Problems
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• Discrete facility location with nonlinear facility costs
• Finding Groups in Data
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Variable neighborhood search for the p-median
• A new partitioning around medoids algorithm
• Heuristic Methods for Location-Allocation Problems
• Local Search Heuristics for k-Median and Facility Location Problems
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems
• Least squares quantization in PCM
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• K-medoids inverse regression
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Integer Programming and the Theory of Grouping
• Matheuristics for the capacitated p‐median problem
• Integer Programming: Methods, Uses, Computations
• Approximating k-median via pseudo-approximation
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Affinity propagation and uncapacitated facility location problems

This page was built for publication: Discrete facility location in machine learning