Solving Facility Location Problem Based on Duality Approach
From MaRDI portal
Publication:2942470
DOI10.1007/978-3-319-08377-3_18zbMath1327.90095OpenAlexW165707573MaRDI QIDQ2942470
Publication date: 11 September 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08377-3_18
Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Discrete location and assignment (90B80)
Cites Work
- Capacitated facility location: Separation algorithms and computational experience
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Improved approximation algorithms for multilevel facility location problems
- Duality principles in nonconvex systems. Theory, methods and applications
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- 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
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
- Integer Programming: Methods, Uses, Computations
This page was built for publication: Solving Facility Location Problem Based on Duality Approach
