Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm.
Stefanie KosuchAbdel LisserPublished in: Ann. Oper. Res. (2010)
Keyphrases
- upper bound
- learning algorithm
- cost function
- detection algorithm
- high accuracy
- worst case
- optimization algorithm
- dynamic programming
- optimal solution
- experimental evaluation
- tight bounds
- matching algorithm
- np hard
- probabilistic model
- linear programming
- computationally efficient
- preprocessing
- data structure
- improved algorithm
- lower and upper bounds
- objective function
- k means
- lower bound
- particle swarm optimization
- segmentation algorithm
- computational complexity
- combinatorial optimization