Stochastic Quadratic Knapsack with Recourse
暂无分享,去创建一个
[1] David Pisinger,et al. The quadratic knapsack problem - a survey , 2007, Discret. Appl. Math..
[2] R. Wets. Programming Under Uncertainty: The Equivalent Convex Program , 1966 .
[3] A. Cohn,et al. The Stochastic Knapsack Problem with Random Weights : A Heuristic Approach to Robust Transportation Planning , 1998 .
[4] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[5] J Figueira,et al. Stochastic Programming , 1998, J. Oper. Res. Soc..
[6] Abdel Lisser,et al. Knapsack problem with probability constraints , 2011, J. Glob. Optim..
[7] B. WETSt,et al. STOCHASTIC PROGRAMS WITH FIXED RECOURSE : THE EQUIVALENT DETERMINISTIC PROGRAM , 2022 .
[8] C. Helmberg,et al. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .
[9] Anton J. Kleywegt,et al. The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..
[10] Chaitanya Swamy,et al. An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.
[11] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[12] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[13] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[14] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[15] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .