On two-stage stochastic knapsack problems

DOI10.1016/J.DAM.2010.04.006MaRDI QIDQ643023zbMATH OpenOpenAlexFDO

Authors Abdel Lisser, Stefanie Kosuch

Publication date 27 October 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.04.006

zbMATH Keywords

normally distributed weightsstochastic knapsack problemtwo stage

Mathematics Subject Classification ID

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

Recommendations

• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• Knapsack problem with probability constraints
• Stochastic quadratic knapsack with recourse
• scientific article; zbMATH DE number 1114460

Cites work

• scientific article; zbMATH DE number 1818845 (Why is no real title available?)
• scientific article; zbMATH DE number 1114460 (Why is no real title available?)
• scientific article; zbMATH DE number 1559582 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
• A robust approach to the chance-constrained knapsack problem
• An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
• Applications of second-order cone programming
• Stochastic on-line knapsack problems
• Stochastic quadratic knapsack with recourse
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The sample average approximation method for stochastic discrete optimization
• The stochastic knapsack problem
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm

Cited in

(17)

• A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
• On the approximability of the two-phase knapsack problem
• The Risk-Averse Static Stochastic Knapsack Problem
• Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem
• Stochastic quadratic knapsack with recourse
• An adaptive stochastic knapsack problem
• Robust recoverable and two-stage selection problems
• Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
• Exact algorithms for the 0-1 time-bomb knapsack problem
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Knapsack problem with probability constraints
• Stochastic nuclear outages semidefinite relaxations
• The stochastic generalized bin packing problem
• Static stochastic Knapsack problems
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem

This page was built for publication: On two-stage stochastic knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643023)