Discrete facility location in machine learning (Q5100135): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:55, 30 December 2024

scientific article; zbMATH DE number 7577097

Language	Label	Description	Also known as
English	Discrete facility location in machine learning	scientific article; zbMATH DE number 7577097

Statements

scholarly article

0 references

Discrete facility location in machine learning (English)

0 references

Anton Vladimirovich Ushakov

0 references

Igor' Leonidovich Vasilyev

0 references

Diskretnyi analiz i issledovanie operatsii

0 references

publication date

29 August 2022

0 references

full work available at URL

http://mathnet.ru/eng/da1284

0 references

zbMATH Keywords

machine learning

0 references

facility location

0 references

clustering

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

0 references

Location-Allocation Problems

0 references

Heuristic Methods for Location-Allocation Problems

0 references

The Weiszfeld Algorithm: Proof, Amendments, and Extensions

0 references

Least squares quantization in PCM

0 references

0 references

0 references

Integer Programming and the Theory of Grouping

0 references

Integer Programming: Methods, Uses, Computations

0 references

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

0 references

Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

0 references

A constant-factor approximation algorithm for the \(k\)-median problem

0 references

0 references

Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms

0 references

An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians

0 references

On the Complexity of Some Common Geometric Location Problems

0 references

The planar \(k\)-means problem is NP-hard

0 references

The Maximum Coverage Location Problem

0 references

NP-hardness of Euclidean sum-of-squares clustering

0 references

Worst-Case and Probabilistic Analysis of a Geometric Location Problem

0 references

The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems

0 references

COBRA: A new formulation of the classic \(p\)-median location problem

0 references

A Canonical Representation of Simple Plant Location Problems and Its Applications

0 references

A tighter formulation of the \(p\)-median problem

0 references

Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

0 references

Algorithm AS 136: A K-Means Clustering Algorithm

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

Local Search Heuristics for <i>k</i>-Median and Facility Location Problems

0 references

0 references

Complexity of local search for the \(p\)-median problem

0 references

A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

0 references

Variable neighborhood search for the p-median

0 references

A fast swap-based local search procedure for location problems

0 references

Greedy randomized adaptive search procedures

0 references

A hybrid heuristic for the \(p\)-median problem

0 references

Finding Groups in Data

0 references

A new partitioning around medoids algorithm

0 references

Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems

0 references

The \(p\)-median problem: a survey of metaheuristic approaches

0 references

Solution methods for thep-median problem: An annotated bibliography

0 references

Computational study of large-scale \(p\)-median problems

0 references

BEAMR: an exact and approximate model for the \(p\)-median problem

0 references

Solving Large <i>p</i>-Median Problems with a Radius Formulation

0 references

Cluster Analysis: An Application of Lagrangian Relaxation

0 references

0 references

Solving the \(p\)-median problem with a semi-Lagrangian relaxation

0 references

An aggregation heuristic for large scale p-median problem

0 references

Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

Approximating k-median via pseudo-approximation

0 references

An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization

0 references

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

0 references

Recovery guarantees for exemplar-based clustering

0 references

Relax, No Need to Round

0 references

The parallel variable neighborhood search for the \(p\)-median problem

0 references

Near-optimal clustering in the \(k\)-machine model

0 references

0 references

Near-optimal large-scale k-medoids clustering

0 references

A parallelized lagrangean relaxation approach for the discrete ordered median problem

0 references

0 references

Clustering by Passing Messages Between Data Points

0 references

Affinity propagation and uncapacitated facility location problems

0 references

Discrete facility location with nonlinear diseconomies in fixed costs

0 references

Discrete facility location with nonlinear facility costs

0 references

A computational study of a nonlinear minsum facility location problem

0 references

Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience

0 references

The double-assignment plant location problem with co-location

0 references

0 references

A strengthened formulation for the simple plant location problem with order

0 references

Polyhedral study of simple plant location problem with order

0 references

A mixed integer linear model for clustering with variable selection

0 references

Solving capacitated clustering problems

0 references

The capacitated centred clustering problem

0 references

A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes

0 references

A matheuristic for large-scale capacitated clustering

0 references

A column generation approach to capacitated \(p\)-median problems

0 references

Model-based capacitated clustering with posterior regularization

0 references

Matheuristics for the capacitated p‐median problem

0 references

Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction

0 references

<i>K</i>-medoids inverse regression

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.33048/DAIO.2021.28.714

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5100135

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5100135&oldid=39531356"