The Multilocation Multiperiod Inventory Problem: Bounds and Approximations

Abstract

The multilocation inventory problem can be thought of naturally as an extension of the single location “newsboy” problem to multiple locations with transshipment possible between locations. Previous work has established the form of optimal policies; however, computational results have been limited to the one-period case or to special structures. This paper develops lower- and upper-bounds for the general multiperiod problem. These also suggest approximations to the optimal solution. Computational methods are discussed and tested on small problems.

Cite this work

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

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

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