## Exact algorithms for the 0-1 Time-bomb Knapsack Problem

We consider a stochastic version of the 0–1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack. The objective is to maximize the expected profit of the selected items. The resulting problem, denoted as 0–1 Time-Bomb Knapsack … Read more