ISSN:
1436-4646
Keywords:
Knapsack problems
;
On-line algorithms
;
Stochastic integer programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log3/2 n). AnΩ(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585758
Permalink