scientific article
From MaRDI portal
Publication:3840357
zbMath0910.90201MaRDI QIDQ3840357
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Clustering to minimize the sum of cluster diameters ⋮ New approximation algorithms for the unsplittable capacitated facility location problem ⋮ On the bounded-hop MST problem on random Euclidean instances ⋮ Computational study of large-scale \(p\)-median problems ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Incremental facility location problem and its competitive algorithms ⋮ The approximation gap for the metric facility location problem is not yet closed ⋮ A simple tabu search for warehouse location ⋮ Facility location models for distribution system design ⋮ 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 Priority k-Median Problem ⋮ Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems ⋮ The General Steiner Tree-Star problem. ⋮ A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem ⋮ Improved approximation algorithms for multilevel facility location problems ⋮ A constant-factor approximation algorithm for the \(k\)-median problem
This page was built for publication:
