arXiv (All)
open access
Grid Theory and Polynomiality in Dynamic Lot-Sizing
Why are some dynamic lot-sizing problems polynomial? We address this question by introducing Grid Theory, a structural framework based on cumulative production and the additive structure of production bounds. For a general single-item dynamic lot-sizing model with lower and upper production bounds,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polynomial dynamic programming algorithms for lot sizing models with bounded inventory and stockout and/or backlogging#354217
- Distributed Santa Claus via Global Rounding#1084194
- Повышение точности расчета размеров листовых заготовок при гибке в штампах за счет учета продольной силы#696031
- A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition#1186321
- Optimal Siting and Sizing of Distributed Generators in Distribution Systems Considering Cost of Operation Risk#16756
Record · ID 1188237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive