Approximation algorithms for soft-capacitated facility location in capacitated network design
From MaRDI portal
Recommendations
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Approximation algorithms for a facility location problem with service capacities
- scientific article; zbMATH DE number 2086924
- An approximation algorithm for soft capacitated k-facility location problem
Cites work
- scientific article; zbMATH DE number 2086213 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- Approximation Algorithms for Metric Facility Location Problems
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Approximation algorithms for a capacitated network design problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Primal-dual algorithms for connected facility location problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(33)- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
- Approximation algorithms for a facility location problem with service capacities
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- Approximation algorithms for the stochastic priority facility location problem
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- A local search approximation algorithm for a squared metric \(k\)-facility location problem
- An improved per-scenario bound for the two-stage stochastic facility location problem
- An approximation algorithm for the stochastic fault-tolerant facility location problem
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Improved approximation algorithms for the robust fault-tolerant facility location problem
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximating soft-capacitated facility location problem with uncertainty
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- A cost-sharing method for the multi-level economic lot-sizing game
- An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Bifactor approximation for location routing with vehicle and facility capacities
- An approximation algorithm for the two-stage distributionally robust facility location problem
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Fault-tolerant concave facility location problem with uniform requirements
- scientific article; zbMATH DE number 2086924 (Why is no real title available?)
- Approximation algorithms for the priority facility location problem with penalties
- An approximation algorithm for the \(k\)-level stochastic facility location problem
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- An approximation algorithm for soft capacitated \(k\)-facility location problem
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
- An approximation algorithm for the dynamic facility location problem with outliers
This page was built for publication: Approximation algorithms for soft-capacitated facility location in capacitated network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024778)
