Worst-Case and Probabilistic Analysis of a Geometric Location Problem

Cited in

(41)

Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Geometric optimization and the polynomial hierarchy
Maximal paths in random dynamic graphs
Probabilistic analysis of two \(k\)-cluster problems
A theory for memory-based learning
Cluster analysis from molecular similarity matrices using a nonlinear neural network
A double annealing algorithm for discrete location/allocation problems
2-medians in trees with pos/neg weights
Worst-case demand distributions in vehicle routing
Heuristic methods and applications: A categorized survey
On the k-center problem with many centers
On the complexity of locating linear facilities in the plane
Quantum speed-up for unsupervised learning
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
The searching over separators strategy to solve some NP-hard problems in subexponential time
An approximation algorithm for the continuous k-medians problem in a convex polygon
A Probabilistic Analysis of the K-Location Problem
scientific article; zbMATH DE number 3829248 (Why is no real title available?)
Probabilistic Analysis of Geometric Location Problems
A space-indexed formulation of packing boxes into a larger box
Exploiting packing components in general-purpose integer programming solvers
Placing resources in a tree: dynamic and static algorithms
Combinational optimization problems for which almost every algorithm is asymptotically optimal
Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
Discrete facility location in machine learning
Wasserstein distance and the distributionally robust TSP
On solving unreliable planar location problems
Max-Min Problems of Searching for Two Disjoint Subsets
k-means clustering in EEG (brain waves) timeseries
Spectral clustering and long timeseries classification
Dynamic and static algorithms for optimal placement of resources in a tree
Computational complexity of the choice problem for typical representatives of a finite point set in a metric space
An effective aggregation heuristic for capacitated facility location problems with many demand points
Competitive location in the plane
Solving resource allocation problems in disaster management using linear programming relaxations
Models for planning capacity expansion in local access telecommunication networks
Aggregation in hub location problems
A note on duality gap in the simple plant location problem
Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
Recovery guarantees for exemplar-based clustering

This page was built for publication: Worst-Case and Probabilistic Analysis of a Geometric Location Problem

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