Facility location problems with submodular penalties and stochastic demands

zbMATH Open1299.90218MaRDI QIDQ5399861FDOQ5399861

Authors: Xing Wang, Dachuan Xu 

Publication date: 28 February 2014

Recommendations

• A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
• Approximation algorithms for the priority facility location problem with submodular penalties
• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Improved approximation algorithms for the facility location problems with linear/submodular penalty

zbMATH Keywords

approximation algorithmprimal-dual algorithmstochastic demandssubmodular penalties

Mathematics Subject Classification ID

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

Cited In (6)

• Stochastic facility location with general long-run costs and convex short-run costs
• The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
• An approximation algorithm for the warehouse-retailer network design problem with submodular penalties
• Title not available (Why is that?)
• The multifacility center problems with random demand weights
• Title not available (Why is that?)

This page was built for publication: Facility location problems with submodular penalties and stochastic demands

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