Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity-Reference-Cited by-同舟云学术

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

Published:2008-11 Issue:4 Volume:33 Page:945-964
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Dean Brian C.,Goemans Michel X.,Vondrák Jan

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Link

https://pubsonline.informs.org/doi/pdf/10.1287/moor.1080.0330

Reference24 articles.

1. An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns

2. On the optimality of LEPT and cµ rules for machines in parallel

3. Dean B. C., Goemans M. X., Vondrák J. Approximating the stochastic knapsack problem: The benefit of adaptivityProc. 45th IEEE Sympos. Found. Comput. Sci. (FOCS)(2004) Rome208217

4. A Renewal Decision Problem

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

1. Configuration balancing for stochastic requests;Mathematical Programming;2024-08-08

2. Nonadaptive Stochastic Score Classification and Explainable Half-Space Evaluation;Operations Research;2024-07-18

3. Decentralized Online Order Fulfillment in Omni-Channel Retailers;Production and Operations Management;2024-05-24

4. The price-elastic knapsack problem;Omega;2024-04

5. Cost-Effective Active Learning for Bid Exploration in Online Advertising;Proceedings of the 17th ACM International Conference on Web Search and Data Mining;2024-03-04