Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
From MaRDI portal
Publication:1631181
DOI10.1007/s00186-018-0642-4zbMath1414.90053OpenAlexW2811346920MaRDI QIDQ1631181
Publication date: 5 December 2018
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-018-0642-4
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The submodular joint replenishment problem
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
- Approximation algorithms for the joint replenishment problem with deadlines
- Computational complexity of uncapacitated multi-echelon production planning problems
- NP-hardness proof for the assembly problem with stationary setup and additive holding costs
- A review of the joint replenishment problem literature: 1989--2005
- Inventory control.
- Latency-constrained aggregation in sensor networks
- 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
- Using the economical order quantity formula for inventory control in one‐warehouse multiretailer systems
- Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs
- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- Improved Algorithms for Economic Lot Size Problems
- A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
- An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
- OpenSolver - An Open Source Add-in to Solve Linear and Integer Progammes in Excel
- Efficient, Effective Lot Sizing for Multistage Production Systems
- Approximation algorithms for general one-warehouse multi-retailer systems
- Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints
- Better Approximation Bounds for the Joint Replenishment Problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- A Facilities in Series Inventory Model with Nested Schedules
- A Simple Continuous Review Deterministic One-Warehouse N-Retailer Inventory Problem
