A PTAS for the chance-constrained knapsack problem with random item sizes-Reference-Cited by-同舟云学术

A PTAS for the chance-constrained knapsack problem with random item sizes

Published:2010-05 Issue:3 Volume:38 Page:161-164
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Goyal Vineet,Ravi R.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference9 articles.

1. Convex Optimization;Boyd,2004

2. An algorithm for maximizing target achievement in the stochastic Knapsack problem with normal returns;Carraway;Naval Research Logostics,1993

3. B. Dean, M. Goemans, J. Vondrak, The benefit of adaptivity: Approximating the stochastic knapsack problem, in: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, FOCS, 2004, pp. 208–217.

4. A. Goel, P. Indyk, Stochastic load balancing and related problems, in: Annual Symposium on Foundations of Computer Science, FOCS, 1999, pp. 579–586.

5. Risk criteria in a stochastic knapsack problem;Henig;Operations Research,1990

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trust-and-Evaluate: A Dynamic Nonmonetary Mechanism for Internal Capital Allocation;Management Science;2024-01-19

2. Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications;IEEE Transactions on Cybernetics;2024

3. Branch and price for submodular bin packing;EURO Journal on Computational Optimization;2023

4. A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem;Lecture Notes in Operations Research;2023

5. Exact algorithms for the 0–1 Time-Bomb Knapsack Problem;Computers & Operations Research;2022-09