Solving facility location problem based on duality approach
From MaRDI portal
Recommendations
Cites work
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Capacitated facility location: Separation algorithms and computational experience
- Duality principles in nonconvex systems. Theory, methods and applications
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved approximation algorithms for multilevel facility location problems
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Integer Programming: Methods, Uses, Computations
- Local Search Heuristics for k-Median and Facility Location Problems
Cited in
(3)
This page was built for publication: Solving facility location problem based on duality approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942470)