B.J. LagewegJan Karel LenstraA.H.G. RinnooyKanLeen StougieA. H. G. Rinnooy Kan
Abstract Stochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions. Dynamic programming techniques can be used to exploit the structure of two–stage scheduling, bin packing and multiknapsack problems. Numerical results for small instances of these problems are presented.
B.J. LagewegJan Karel LenstraA. R. KanLeen Stougie
Christian FüllnerShixuan ZhangSteffen RebennackXu Andy Sun
Jikai ZouShabbir AhmedXu Andy Sun