An approximation algorithm for the maximization version of the two level uncapacitated facility location problem

DOI10.1016/S0167-6377(01)00087-6zbMath0993.90066OpenAlexW2054672778MaRDI QIDQ1604042

Adriana Bumb

Publication date: 3 July 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00087-6

zbMATH Keywords

facility locationapproximation algorithmsrandomized algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (10)

Combinatorial approximation algorithms for the robust facility location problem with penalties ⋮ A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A review of hierarchical facility location models ⋮ Multi-level facility location problems ⋮ The vendor location problem ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ An approximation algorithm for the \(k\)-level facility location problem with outliers ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ A note on the maximization version of the multi-level facility location problem

Cites Work

• Approximation algorithms for geometric median problems
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• On the Two-Level Uncapacitated Facility Location Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for the maximization version of the two level uncapacitated facility location problem