Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”

Maurice Queyranne

14 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Supply Chain and Inventory Management Scheduling and Optimization Algorithms Optimization and Mathematical Programming

Abstract

The Dynamic Programming algorithm proposed by Rosenblatt and Kaspi (Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31(March) 369–373.) for an optimum partition problem is shown to be incorrect. An alternative Dynamic Programming algorithm is presented for this problem.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 14 citations exist upstream.

References

1985Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.