A PTAS for the chance-constrained knapsack problem with random item sizes
From MaRDI portal
Publication:974983
DOI10.1016/J.ORL.2010.01.003zbMATH Open1187.90232OpenAlexW1976174751MaRDI QIDQ974983FDOQ974983
Publication date: 8 June 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.01.003
Recommendations
- scientific article; zbMATH DE number 7561426
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- A robust approach to the chance-constrained knapsack problem
- Chance-Constrained Submodular Knapsack problem
- Random knapsacks with many constraints
- Publication:4952619
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- scientific article; zbMATH DE number 1114460
- A PTAS for the multiple subset sum problem with different knapsack capacities
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- Title not available (Why is that?)
Cited In (25)
- Lifting of probabilistic cover inequalities
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- Approximation algorithms for stochastic combinatorial optimization problems
- Robust optimization approach for a chance-constrained binary knapsack problem
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- A heuristic column generation approach for the stochastic bin packing problem
- Piecewise static policies for two-stage adjustable robust linear optimization
- The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Relaxations and approximations of chance constraints under finite distributions
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
- A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation
- Gamma distribution approach in chance-constrained stochastic programming model
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
- Bicriteria Approximation of Chance-Constrained Covering Problems
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Adaptivity in the stochastic blackjack knapsack problem
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
- Title not available (Why is that?)
This page was built for publication: A PTAS for the chance-constrained knapsack problem with random item sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974983)
