The submodular joint replenishment problem
type: Item
instance of: scholarly article
title: The submodular joint replenishment problem
zbMATH Open document ID: 1346.90301
author: Maurice Cheung
author: Adam N. Elmachtoub
author: Retsef Levi
author: David B. Shmoys
published in: Mathematical Programming. Series A. Series B
publication date: 2016-08-25T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/98901
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 6619163
zbMATH Keywords: inventory management
zbMATH Keywords: approximation algorithm
zbMATH Keywords: submodular function
zbMATH Keywords: joint replenishment problem
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2208994903
cites work: Computational complexity of uncapacitated multi-echelon production planning problems
cites work: Latency Constrained Aggregation in Sensor Networks
cites work: Better Approximation Bounds for the Joint Replenishment Problem
cites work: Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
cites work: The Joint Replenishment Problem with General Joint Cost Structures
cites work: Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
cites work: Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
cites work: The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
cites work: A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
cites work: Q4737152
cites work: Primal-Dual Algorithms for Deterministic Inventory Problems
cites work: A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
cites work: Maintenance scheduling for modular systems: Modeling and algorithms
cites work: Approximation algorithms for inventory problems with submodular or routing costs
cites work: A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
cites work: An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem
cites work: A faster strongly polynomial time algorithm for submodular function minimization
cites work: 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
cites work: Q4221106
cites work: Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
cites work: An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem
cites work: Q5365022
cites work: Facility location with hierarchical facility costs
cites work: Multistage Lot Sizing Problems via Randomized Rounding
cites work: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
cites work: An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem
cites work: Dynamic version of the economic lot size model
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
DOI: 10.1007/S10107-015-0920-3
description: scientific article; zbMATH DE number 6619163