期刊
ANNALS OF OPERATIONS RESEARCH
卷 176, 期 1, 页码 77-93出版社
SPRINGER
DOI: 10.1007/s10479-009-0577-5
关键词
Static stochastic knapsack problems with random weights; Simple recourse; Chance constrained; Expectation constrained; B&B algorithm; Stochastic gradient algorithm; Arrow-Hurwicz; SOCP
In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well as the stochastic knapsack problem with probabilistic constraint. Special interest is given to the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems allows to provide upper bounds in a branch-and-bound framework in order to solve the original problems. Numerical results on a dataset from the literature as well as a set of randomly generated instances are given.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据