The Competitive Ratio of Threshold Policies for Online Unit-Density Knapsack Problems
Published Online:17 Oct 2025https://doi.org/10.1287/mnsc.2023.01577
Supplemental Material
The replication files for this article are available HERE.
Articles In Advance
Article Information
Supplemental Material
Metrics
Information
- Received:May 24, 2023
- Accepted:March 30, 2025
- Published Online:October 17, 2025
Copyright © 2025, INFORMS
Cite as
Will Ma, David Simchi-Levi, Jinglong Zhao (2025) The Competitive Ratio of Threshold Policies for Online Unit-Density Knapsack Problems. Management Science 0(0).
https://doi.org/10.1287/mnsc.2023.01577
Keywords
The authors thank Łukasz Jeż for pointing us to several references, including Han et al. (2015) and Cygan et al. (2016). The authors thank the department editor George Shanthikumar, the anonymous associate editor, and the anonymous reviewers for their insightful suggestions. In particular, Theorem 6 is shown by one of our reviewers.
