Skip to content

On the Complexity of Knapsack Under Explorable Uncertainty: Hardness and Algorithms.

Jens Schlter

VenueAESA
Year2025
ProceedingsESA

Browse the full ESA paper archive.