most citedA graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2026★ 1 cited

A graph-based heuristic for the non-stationary stochastic lot-sizing problem under penalty costs

Xiyuan Ma, Roberto Rossi, Thomas Welsh Archibald

This paper introduces a graph-based algorithm for solving single-item, single-location inventory lot-sizing problems under non-stationary stochastic demand using the p…

math.OC2026

Mixed-Integer Linear Programming Approximations for the Stochastic Knapsack

Roberto Rossi, Steven D. Prestwich, S. Armagan Tarim

We develop mathematical programming approximations to tackle the stochastic knapsack problem. In this problem, the decision maker considers items for which either weights or values…