暂无分享,去创建一个
[1] Danny Segev,et al. An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem , 2020, ArXiv.
[2] Hans Kellerer,et al. Knapsack problems , 2004 .
[3] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[4] Hans Kellerer,et al. Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..
[5] Timothy M. Chan. Approximation Schemes for 0-1 Knapsack , 2018, SOSA.
[6] Danny Segev,et al. Approximation Algorithms for The Generalized Incremental Knapsack Problem , 2020, ArXiv.
[7] Sanjeev Khanna,et al. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..
[8] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[9] Ruhul A. Sarker,et al. A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry , 2017 .
[10] Daniel Bienstock,et al. Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming , 2013, ArXiv.
[11] Yuri Faenza,et al. A PTAS for the Time-Invariant Incremental Knapsack Problem , 2018, ISCO.
[12] Chung-Min Wu,et al. The multiple-choice multi-period knapsack problem , 2004, J. Oper. Res. Soc..
[13] Eduardo Moreno,et al. Large-scale multi-period precedence constrained knapsack problem: A mining application , 2010, Electron. Notes Discret. Math..
[14] Bruce H. Faaland. Technical Note - The Multiperiod Knapsack Problem , 1981, Oper. Res..
[15] Federico Della Croce,et al. Approximating the Incremental Knapsack Problem , 2019, Discret. Appl. Math..
[16] Klaus Jansen,et al. A Fast Approximation Scheme for the Multiple Knapsack Problem , 2012, SOFSEM.
[17] Alexa Sharp,et al. An Incremental Model for Combinatorial Maximization Problems , 2006, WEA.
[18] G. B. Mathews. On the Partition of Numbers , 1896 .
[19] Sanjay V. Rajopadhye,et al. Unbounded knapsack problem: Dynamic programming revisited , 2000, Eur. J. Oper. Res..