The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature

DOI10.1016/j.disopt.2012.12.001zbMath1284.90065OpenAlexW1998513960MaRDI QIDQ2445842

Asaf Levin, Aleksander Vainer

Publication date: 15 April 2014

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.12.001

zbMATH Keywords

knapsack problembenefit of adaptivity

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (3)

Adaptivity in the stochastic blackjack knapsack problem ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Queue-constrained packing: a vehicle ferry case study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• The Dynamic and Stochastic Knapsack Problem with Deadlines

This page was built for publication: The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature