Approximation algorithm for uniform bounded facility location problem

DOI10.1007/S10878-012-9461-3MaRDI QIDQ2392747zbMATH OpenOpenAlexFDO

Authors Weng Kerui

Publication date 2 August 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9461-3

zbMATH Keywords

approximation algorithmfacility locationBenders decompositionrouting costs bound

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithm for the uniform bounded facility problem
• An approximation framework for bounded facility location problems
• A 3-approximation algorithm for the facility location problem with uniform capacities
• A local search approximation algorithm for the uniform capacitated k-facility location problem
• Algorithms - ESA 2003

Cites work

• scientific article; zbMATH DE number 1253050 (Why is no real title available?)
• scientific article; zbMATH DE number 1559542 (Why is no real title available?)
• scientific article; zbMATH DE number 2086926 (Why is no real title available?)
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• A better constant-factor approximation for weighted dominating set in unit disk graph
• A threshold of ln n for approximating set cover
• Algorithms for facility location problems with outliers. (Extended abstract)
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• Approximation Algorithms for Metric Facility Location Problems
• Approximation algorithms for bounded facility location problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Improved Combinatorial Algorithms for Facility Location Problems
• Medi-centre Location Problems
• The approximation gap for the metric facility location problem is not yet closed

Cited in

(6)

• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• An approximation framework for bounded facility location problems
• A voltage drop limited decentralized electric power distribution network
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
• On facility location with general lower bounds
• Approximation algorithm for the uniform bounded facility problem

This page was built for publication: Approximation algorithm for uniform bounded facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392747)