Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack

zbMATH Open1403.90568arXiv1712.00918MaRDI QIDQ4607972FDOQ4607972

Authors: Anindya De 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1712.00918

Recommendations

• Improved approximation results for stochastic knapsack problems
• Stochastic combinatorial optimization via Poisson approximation
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• scientific article; zbMATH DE number 1114460

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Stochastic programming (90C15) Approximation algorithms (68W25)

Cited In (5)

• Title not available (Why is that?)
• Stochastic combinatorial optimization via Poisson approximation
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
• Title not available (Why is that?)

This page was built for publication: Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack

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