scientific article; zbMATH DE number 1303535
From MaRDI portal
Publication:4250157
Recommendations
- Analysis of a Local Search Heuristic for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- scientific article; zbMATH DE number 1670526
- Local search heuristic for k-median and facility location problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Cited in
(52)- Approximation algorithms for connected facility location problems
- Joint object placement and node dimensioning for internet content distribution
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- An effective heuristic for large-scale capacitated facility location problems
- Applying extra-resource analysis to load balancing.
- Generalized submodular cover problems and applications
- Complexity of single-swap heuristics for metric facility location and related problems
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
- Improved approximation algorithms for capacitated facility location problems
- Improved approximation algorithms for multilevel facility location problems
- Clustering to minimize the sum of cluster diameters
- Probabilistic analysis of facility location on random shortest path metrics
- Facility location problems: a parameterized view
- A new approximation algorithm for the k-facility location problem
- On the bounded-hop MST problem on random Euclidean instances
- Perturbation resilience for the facility location problem
- On the competitive ratio for online facility location
- New approximation results for resource replication problems
- scientific article; zbMATH DE number 1670526 (Why is no real title available?)
- New approximation algorithms for the unsplittable capacitated facility location problem
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- Analysis of a local search algorithm for the k-facility location problem
- Local search algorithms for \(k\)-median and \(k\)-facility location problems with linear penalties
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
- Comparison and analysis of ten static heuristics-based Internet data replication techniques
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- Analysis of a Local Search Heuristic for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Recent developments in approximation algorithms for facility location and clustering problems
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Local search heuristic for k-median and facility location problems
- A survey on approximation algorithms for facility location problems
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
- The Priority k-Median Problem
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Local-search based approximation algorithms for mobile facility location problems (extended abstract)
- Constant factor approximation algorithm for the knapsack median problem
- Theory and Applications of Models of Computation
- Approximation algorithms for hierarchical location problems
- Approximation algorithms for bounded facility location problems
- A local search approximation algorithm for \(k\)-means clustering
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
- An approximation algorithm for the k-level capacitated facility location problem
- Facility location models for distribution system design
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- A cutting plane algorithm for the capacitated facility location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Recovery guarantees for exemplar-based clustering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250157)
