Chance-constrained Packing Problems | Suppressing pseudocodewords by penalizing the objective of LP decoding
Song’s abstract —————————- We consider a probabilistic version of classical 0-1 packing problem, where we have a set of items with random weights and a random knapsack capacity. The objective is to choose a set of items that maximizes profit while ensuring the probability that the knapsack constraint is satisfi ed …