An approximation algorithm for reliable facility location problem

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.04.002MaRDI QIDQ2993687zbMATH OpenFDO

Authors Lincheng Yan, Han Xiao, Hongjuan Zhao, Xiaoqi Sun

Publication date 10 August 2016

zbMATH Keywords

reliabilityapproximation algorithmfacility location problemgreedy methodprimal dual

Mathematics Subject Classification ID

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

Recommendations

• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Improved algorithms for fault tolerant facility location
• Reliable facility location design under the risk of disruptions
• Improved approximation algorithms for the robust fault-tolerant facility location problem

Cited in

(7)

• A two-stage robust model for a reliable p-center facility location problem
• Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
• The reliable \(p\)-median problem with at-facility service
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• Multiple facility location on a network with linear reliability order of edges
• A facility reliability problem: Formulation, properties, and algorithm
• Reliability problems in multiple path-shaped facility location on networks

This page was built for publication: An approximation algorithm for reliable facility location problem

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