Discrete facility location in machine learning
From MaRDI portal
Recommendations
- Near-optimal clustering in the \(k\)-machine model
- Algorithms for facility location problems with outliers. (Extended abstract)
- A survey on approximation algorithms for facility location problems
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Location analysis: a synthesis and survey
Cites work
- K-medoids inverse regression
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- A column generation approach to capacitated p-median problems
- A computational study of a nonlinear minsum facility location problem
- A constant-factor approximation algorithm for the k-median problem
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A fast swap-based local search procedure for location problems
- A hybrid heuristic for the \(p\)-median problem
- A matheuristic for large-scale capacitated clustering
- A mixed integer linear model for clustering with variable selection
- A new partitioning around medoids algorithm
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- A strengthened formulation for the simple plant location problem with order
- A tighter formulation of the p-median problem
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- Affinity propagation and uncapacitated facility location problems
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithms for facility location problems with outliers. (Extended abstract)
- An aggregation heuristic for large scale p-median problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximate clustering without the approximation
- Approximating k-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- BEAMR: an exact and approximate model for the p-median problem
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
- Cluster Analysis: An Application of Lagrangian Relaxation
- Clustering by passing messages between data points
- Clustering with Bregman divergences.
- COBRA: A new formulation of the classic \(p\)-median location problem
- Complexity of local search for the \(p\)-median problem
- Computational study of large-scale p-median problems
- Discrete facility location with nonlinear diseconomies in fixed costs
- Discrete facility location with nonlinear facility costs
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Finding Groups in Data
- Genetic local search for the p-median problem with client preferences
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy randomized adaptive search procedures
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Integer Programming and the Theory of Grouping
- Integer Programming: Methods, Uses, Computations
- Least squares quantization in PCM
- Local Search Heuristics for k-Median and Facility Location Problems
- Location-Allocation Problems
- Matheuristics for the capacitated p-Median problem
- Model-based capacitated clustering with posterior regularization
- Near-optimal clustering in the \(k\)-machine model
- Near-optimal large-scale k-medoids clustering
- NP-hardness of Euclidean sum-of-squares clustering
- On the Complexity of Some Common Geometric Location Problems
- On the complexity of the local search in the p-median problem
- 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
- Polyhedral study of simple plant location problem with order
- Recent developments in approximation algorithms for facility location and clustering problems
- Recovery guarantees for exemplar-based clustering
- Relax, no need to round: integrality of clustering formulations
- Solution methods for thep-median problem: An annotated bibliography
- Solving capacitated clustering problems
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Solving large p-median problems with a radius formulation
- Solving the p-median problem with a semi-Lagrangian relaxation
- The \(p\)-median problem: a survey of metaheuristic approaches
- The capacitated centred clustering problem
- The double-assignment plant location problem with co-location
- The Maximum Coverage Location Problem
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- The parallel variable neighborhood search for the \(p\)-median problem
- The planar \(k\)-means problem is NP-hard
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Variable neighborhood search for the p-median
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
This page was built for publication: Discrete facility location in machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100135)
