Publication:3840357
From MaRDI portal
zbMath0910.90201MaRDI QIDQ3840357
Publication date: 10 August 1998
Related Items
The Priority k-Median Problem, A simple tabu search for warehouse location, Facility location models for distribution system design, Computational study of large-scale \(p\)-median problems, Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, Improved approximation algorithms for capacitated facility location problems, Non-Euclidean restricted memory level method for large-scale convex optimization, Near-optimal solutions to large-scale facility location problems, The General Steiner Tree-Star problem., Improved approximation algorithms for multilevel facility location problems, A constant-factor approximation algorithm for the \(k\)-median problem, Clustering to minimize the sum of cluster diameters, On the bounded-hop MST problem on random Euclidean instances, The approximation gap for the metric facility location problem is not yet closed