Approximation algorithms for general one-warehouse multi-retailer systems

DOI10.1002/NAV.20367MaRDI QIDQ5305566zbMATH OpenOpenAlexFDO

Authors Jia Shu, David Simchi-Levi, Chung-Piaw Teo, Zuo-Jun (Max) Shen, Jiawei Zhang

Publication date 22 March 2010

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

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

zbMATH Keywords

approximation algorithmsinventory planningnetwork flow

Mathematics Subject Classification ID

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

Recommendations

• Fast approximation algorithms for the one-warehouse multi-retailer problem under general cost structures and capacity constraints
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs

Cites work

• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A constant approximation algorithm for the one-warehouse multiretailer problem
• A polyhedral approach to multicommodity survivable network design
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• An economic lot-sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis
• Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
• Global search algorithms for minimum concave-cost network flow problems
• scientific article; zbMATH DE number 1532274 (Why is no real title available?)
• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• scientific article; zbMATH DE number 6472639 (Why is no real title available?)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Minimum cost capacity installation for multicommodity network flows
• Network Design Using Cut Inequalities
• On the Complexity of the Production-Transportation Problem
• Perishable Inventory Theory: A Review
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Stochastic Transportation-Inventory Network Design Problem
• Strongly polynomial time algorithms for certain concave minimization problems on networks

Cited in

(9)

• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• The warehouse-inventory-transportation problem for supply chains
• An incremental approach for storage and delivery planning problems
• Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
• Integrated Supply Chain Management via Randomized Rounding
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
• Approximation algorithms for supply chain planning and logistics problems with market choice
• New exact and heuristic algorithms for general production and delivery integration

This page was built for publication: Approximation algorithms for general one-warehouse multi-retailer systems

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