Jul 4, 2022 · Abstract: We study the correlated stochastic knapsack problem of a submodular target function, with optional additional constraints.
scholar.google.com › citations
Sep 1, 2022 · The old algorithm imposes the partition matroid while doing the first rounding step, leading to dependency between items. This seemingly ...
Abstract. We study the correlated stochastic knapsack problem of a submodular target function, with optional additional constraints.
Abstract. We study the correlated stochastic knapsack problem of a submodular target function, with optional additional constraints.
Correlated Stochastic Knapsack with a Submodular Objective
www.researchgate.net › publication › 36...
Nov 24, 2024 · We study the correlated stochastic knapsack problem of a submodular target function, with optional additional constraints.
Correlated Stochastic Knapsack with a Submodular Objective
www.scholars.northwestern.edu › correla...
Sep 1, 2022 · We study the correlated stochastic knapsack problem of a submodular target function, with optional additional constraints.
Jul 4, 2022 · This work utilizes the multilinear extension of submodular function, and bundles it with an adaptation of the relaxed linear constraints ...
Sheng Yang, Samir Khuller, Sunav Choudhary , Subrata Mitra, Kanak Mahadik: Correlated Stochastic Knapsack with a Submodular Objective.
People also ask
What is the dynamic and stochastic knapsack problem?
What is the main objective of the knapsack problem?
Correlated Stochastic Knapsack with a Submodular Objective. Authors: Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, and Kanak Mahadik.
The goal of the problem is to select items so as to maximize the utility function subject to constraints.