An approximation algorithm for the warehouse-retailer network design problem with submodular penalties

MaRDI QIDQ4901337zbMATH OpenFDO

Authors Yu Li, Dachuan Xu

Publication date 24 January 2013

zbMATH Keywords

approximation algorithmnetwork designwarehouse-retailer

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A primal-dual approximation algorithm for the facility location problem with submodular penalties
• Approximation algorithms for the priority facility location problem with submodular penalties
• A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
• Facility location problems with submodular penalties and stochastic demands
• A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties

Cited in

(2)

• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
• Approximate Submodularity in Network Design Problems

This page was built for publication: An approximation algorithm for the warehouse-retailer network design problem with submodular penalties

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