Combinatorial approximation algorithms for the robust facility location problem with penalties

DOI10.1007/S10898-014-0251-6zbMATH Open1343.90049OpenAlexW1979118400MaRDI QIDQ280977FDOQ280977

Authors: Fengmin Wang, Dachuan Xu, Chenchen Wu 

Publication date: 10 May 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0251-6

Recommendations

• Approximation Algorithms for the Robust Facility Location Problem with Penalties
• Approximation algorithms for the fault-tolerant facility location problem with penalties
• Approximation algorithms for the priority facility location problem with penalties
• Approximate robust optimization for the connected facility location problem
• A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties
• Approximation algorithm for the fault-tolerant facility placement problem with penalties
• Improved approximation algorithms for the robust fault-tolerant facility location problem
• Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
• An approximation algorithm for the two-stage distributionally robust facility location problem
• scientific article

zbMATH Keywords

approximation algorithmfacility location problemgreedy augmentationprimal-dual

Mathematics Subject Classification ID

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

Cites Work

• The design of approximation algorithms
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
• Approximating the two-level facility location problem via a quasi-greedy approach
• Algorithms for facility location problems with outliers. (Extended abstract)
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
• Approximation algorithms for soft-capacitated facility location in capacitated network design
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
• A cross-monotonic cost sharing method for the facility location game with service installation costs
• An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
• Improved approximation algorithms for capacitated facility location problems
• A new approximation algorithm for the \(k\)-facility location problem
• A cross-monotonic cost-sharing scheme for the concave facility location game
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• The \(k\)-level facility location game
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Integrating facility location and production planning decisions
• Robust Fault Tolerant uncapacitated facility location
• Title not available (Why is that?)
• A 3-approximation for facility location with uniform capacities
• Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
• Improved approximation algorithms for the robust fault-tolerant facility location problem
• Title not available (Why is that?)
• The facility location problem with general cost functions
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
• Improved Combinatorial Algorithms for Facility Location Problems
• Title not available (Why is that?)
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• Algorithms - ESA 2003
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• LP-based approximation algorithms for capacitated facility location

Cited In (6)

• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• A utility theory based interactive approach to robustness in linear optimization
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
• On the power of static assignment policies for robust facility location problems
• Approximation Algorithms for the Robust Facility Location Problem with Penalties
• Application of a distributionally robust optimization approach for single-period stochastic inventory problems with different carbon policies

This page was built for publication: Combinatorial approximation algorithms for the robust facility location problem with penalties

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