Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
type: Item
instance of: scholarly article
title: Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
zbMATH Open document ID: 0631.90054
author: Maurice Queyranne
published in: Management Science
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 4027179
zbMATH Keywords: optimum partition
MaRDI profile type: MaRDI publication profile
full work available at URL: mnsc.33.1.131
OpenAlex ID: W2006533800
DOI: 10.1287/MNSC.33.1.131
Recommended article: Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
Recommended article: The dynamic lot size model with quantity discount: Counterexamples and correction
Recommended article: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
Recommended article: A New Optimal Algorithm for the Joint Replenishment Problem
Recommended article: An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem
description: scientific article