-
3
-
-
84989730011
-
An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
-
R.L. Carraway, R.L. Schmidt, and L.R. Weatherford An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns Naval Research Logistics 40 2 1993 161 173
-
(1993)
Naval Research Logistics
, vol.40
, Issue.2
, pp. 161-173
-
-
Carraway, R.L.1
Schmidt, R.L.2
Weatherford, L.R.3
-
6
-
-
17744371900
-
Approximating the stochastic knapsack problem: The benefit of adaptivity
-
Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Sciences, FOCS 2004
-
B.C. Dean, M.X. Goemans, J. Vondrák, Approximating the stochastic knapsack problem: the benefit of adaptivity, in: Proceedings 45th Annual IEEE 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2004, pp. 208217. (Pubitemid 40575282)
-
(2004)
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
, pp. 208-217
-
-
Dean, B.C.1
Goemans, M.X.2
Vondrak, J.3
-
8
-
-
0025493443
-
Risk criteria in a stochastic knapsack problem
-
M.I. Henig Risk criteria in a stochastic knapsack problem Operations Research 38 5 1990 820 825
-
(1990)
Operations Research
, vol.38
, Issue.5
, pp. 820-825
-
-
Henig, M.I.1
-
10
-
-
0030699603
-
Allocating bandwidth for bursty connections
-
J. Kleinberg, Y. Rabani, E. Tardos, Allocating bandwidth for bursty connections, in: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, 1997, pp. 664673.
-
(1997)
Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing
, pp. 664-673
-
-
Kleinberg, J.1
Rabani, Y.2
Tardos, E.3
-
11
-
-
0035008943
-
The dynamic and stochastic knapsack problem with random sized items
-
A.J. Kleywegt, and J.D. Papastavrou The dynamic and stochastic knapsack problem with random sized weights Operations Research 49 2001 26 41 (Pubitemid 32486526)
-
(2001)
Operations Research
, vol.49
, Issue.1
, pp. 26-41
-
-
Kleywegt, A.J.1
Papastavrou, J.D.2
-
12
-
-
0036013019
-
The sample average approximation method for stochastic discrete optimization
-
A.J. Kleywegt, A. Shapiro, and T.H. de mello The sample average approximation method for stochastic discrete optimization SIAM Journal on Optimization 12 2001 479 502
-
(2001)
SIAM Journal on Optimization
, vol.12
, pp. 479-502
-
-
Kleywegt, A.J.1
Shapiro, A.2
De Mello, T.H.3
-
14
-
-
77949424327
-
Upper bounds for the 01 stochastic knapsack problem and a b&b algorithm
-
S. Kosuch, and A. Lisser Upper bounds for the 01 stochastic knapsack problem and a b&b algorithm Annals of Operations Research 176 1 2010 77 93
-
(2010)
Annals of Operations Research
, vol.176
, Issue.1
, pp. 77-93
-
-
Kosuch, S.1
Lisser, A.2
-
15
-
-
80051796098
-
-
Laboratoire de recherche en informatique, Université Paris Sud, Orsay, France
-
A. Lisser, R. Lopez, X. Hu, Stochastic quadratic knapsack with recourse, Working Paper, Laboratoire de recherche en informatique, Université Paris Sud, Orsay, France, 2009.
-
(2009)
Stochastic Quadratic Knapsack with Recourse, Working Paper
-
-
Lisser, A.1
Lopez, R.2
Hu, X.3
-
17
-
-
0003132254
-
On a stochastic knapsack problem and generalizations
-
Kluwer Academic Publishers Norwell, MA, USA
-
D.P. Morton, and R.K. Wood On a stochastic knapsack problem and generalizations Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search 1997 Kluwer Academic Publishers Norwell, MA, USA 149 168
-
(1997)
Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search
, pp. 149-168
-
-
Morton, D.P.1
Wood, R.K.2
|