An FPTAS for stochastic unbounded min-knapsack problem

DOI10.1007/978-3-030-18126-0_11MaRDI QIDQ2327094zbMATH OpenOpenAlexFDO

Authors Zhihao Jiang, Haoyu Zhao

Publication date 11 October 2019

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

zbMATH Keywords

approximation algorithmsrenewal decision problemstochastic knapsack

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• A relaxed FPTAS for chance-constrained knapsack
• scientific article; zbMATH DE number 1114460
• Static stochastic Knapsack problems

Cited in

(2)

• A relaxed FPTAS for chance-constrained knapsack
• Scheduling splittable jobs on configurable machines

This page was built for publication: An FPTAS for stochastic unbounded min-knapsack problem

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