Approximation algorithms for general one-warehouse multi-retailer systems

DOI10.1002/nav.20367zbMath1183.90063OpenAlexW2064865004MaRDI QIDQ5305566

Chung-Piaw Teo, David Simchi-Levi, Jia Shu, Zuo-Jun Max Shen, Jia-Wei Zhang

Publication date: 22 March 2010

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20367

zbMATH Keywords

approximation algorithmsnetwork flowinventory planning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs ⋮ Integrated Supply Chain Management via Randomized Rounding ⋮ The warehouse-inventory-transportation problem for supply chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global search algorithms for minimum concave-cost network flow problems
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• Minimum cost capacity installation for multicommodity network flows
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• A polyhedral approach to multicommodity survivable network design
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• An economic lot-sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Perishable Inventory Theory: A Review
• On the Complexity of the Production-Transportation Problem
• Network Design Using Cut Inequalities
• Stochastic Transportation-Inventory Network Design Problem