A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints

Abstract

No abstract was published for this record.

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 — 30 citations exist upstream.

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