Abstract: In the stochastic knapsack problem, we are given a knapsack of size B, and a set of items whose sizes and rewards are drawn from a known probability distribution. To know the actual size and ...

This repository contains the final project for the Advanced Algorithms course (MLDM 2022–2024), Université Jean Monnet. It implements and evaluates multiple strategies to solve the classical 0/1 ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...

In this talk we will present approximation algorithms (and general techniques) for some basic problems in the field of stochastic optimization. A canonical problem is stochastic knapsack: we are given ...