The submodular joint replenishment problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2086617 (Why is no real title available?)
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Greedy Heuristic for the Set-Covering Problem
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- A constant approximation algorithm for the one-warehouse multiretailer problem
- A faster strongly polynomial time algorithm for submodular function minimization
- A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
- An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem
- An approximate dynamic-programming approach to the joint replenishment problem
- An efficient polynomial-time approximation scheme for the joint replenishment problem
- Approximation algorithms and hardness results for the joint replenishment problem with constant demands
- Approximation algorithms for inventory problems with submodular or routing costs
- Better Approximation Bounds for the Joint Replenishment Problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic version of the economic lot size model
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- Facility location with hierarchical facility costs
- Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
- Latency Constrained Aggregation in Sensor Networks
- Maintenance scheduling for modular systems: modeling and algorithms
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Multistage Lot Sizing Problems via Randomized Rounding
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
- The Joint Replenishment Problem with General Joint Cost Structures
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
Cited in
(10)- Improved approximation algorithms for inventory problems
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
- Supply chain management with online customer selection
- Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
- An online joint replenishment problem combined with single machine scheduling
- Approximation algorithms for inventory problems with submodular or routing costs
- An extension of the stochastic joint-replenishment problem under the class of cyclic policies
- Polymatroid optimization, submodularity, and joint replenishment games
- Joint replenishment meets scheduling
This page was built for publication: The submodular joint replenishment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304238)
