The authors create a distributionally robust formulation for the cyclic inventory routing problem that admits a deterministic reformulation via multi-point worst-case distributions and chance-constraint equivalents, solved by nested branch-and-price and tested on real automotive data.
Iie Transactions , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Distributionally Robust Cyclic Inventory Routing Problem
The authors create a distributionally robust formulation for the cyclic inventory routing problem that admits a deterministic reformulation via multi-point worst-case distributions and chance-constraint equivalents, solved by nested branch-and-price and tested on real automotive data.