scientific article; zbMATH DE number 7053311
From MaRDI portal
zbMath1423.68195MaRDI QIDQ5743432
M. I. Sviridenko, Ravishankar Krishnaswamy
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095175
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties, Approximation algorithms for \(k\)-level stochastic facility location problems, Robust network function virtualization, An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities, A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach, Approximation algorithms for the robust/soft-capacitated 2-level facility location problems, An approximation algorithm for the \(k\)-level facility location problem with outliers, Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A new approximation algorithm for the multilevel facility location problem
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Discrete and fractional programming techniques for location models
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- The simple plant location problem: Survey and synthesis
- Improved approximation algorithms for multilevel facility location problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A threshold of ln n for approximating set cover
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- A Greedy Heuristic for the Set-Covering Problem
- A Dual-Based Procedure for Dynamic Facility Location
- A Plant and Warehouse Location Problem
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- On the Two-Level Uncapacitated Facility Location Problem
- Facility location with hierarchical facility costs
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
