A Repair-based approach for stochastic quadratic multiple knapsack problem
暂无分享,去创建一个
[1] Michael J. Fry,et al. An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition , 2010, Comput. Oper. Res..
[2] E. Steinberg,et al. A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards , 1979 .
[3] Jin-Kao Hao,et al. Iterated responsive threshold search for the quadratic multiple knapsack problem , 2015, Ann. Oper. Res..
[4] Abdel Lisser,et al. Stochastic Quadratic Knapsack with Recourse , 2010, Electron. Notes Discret. Math..
[5] Ashish Goel,et al. Stochastic load balancing and related problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[6] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[7] Ashish Goel,et al. Improved approximation results for stochastic knapsack problems , 2011, SODA '11.
[8] Han Hoogeveen,et al. Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem , 2017, Comput. Oper. Res..
[9] Yuval Rabani,et al. Allocating Bandwidth for Bursty Connections , 2000, SIAM J. Comput..
[10] Fred W. Glover,et al. An evolutionary path relinking approach for the quadratic multiple knapsack problem , 2016, Knowl. Based Syst..
[11] Steffen Grünewälder,et al. Optimistic Planning for the Stochastic Knapsack Problem , 2017, AISTATS.
[12] Rolf H. Möhring,et al. The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.
[13] J. Hartman,et al. Approximating the solution of a dynamic, stochastic multiple knapsack problem , 2006 .
[14] Daniele Frigioni,et al. Recoverable Robustness in Shunting and Timetabling , 2009, Robust and Online Large-Scale Optimization.
[15] R. K. Wood,et al. On a stochastic knapsack problem and generalizations , 1997 .
[16] Joseph C. Hartman,et al. An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem , 2009, Int. Trans. Oper. Res..
[17] Alejandro Toriello,et al. Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes , 2019, SIAM J. Optim..
[18] Leo G. Kroon,et al. Recoverable Robustness for Railway Rolling Stock Planning , 2008, ATMOS.