A note on upper bounds to the robust knapsack problem with discrete scenarios
暂无分享,去创建一个
[1] Michele Monaci,et al. Exact solution of the robust knapsack problem☆ , 2013, Comput. Oper. Res..
[2] Arie M. C. A. Koster,et al. Recoverable robust knapsacks: the discrete scenario case , 2011, Optim. Lett..
[3] BYUNGJUN YOU,et al. An Improved Reduction Method for the Robust Optimization of the Assignment Problem , 2012, Asia Pac. J. Oper. Res..
[4] Hiroshi Iida. A Note on the Max-Min 0-1 Knapsack Problem , 1999, J. Comb. Optim..
[5] Arkadi Nemirovski,et al. Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..
[6] S. Martello,et al. An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .
[7] Allen L. Soyster,et al. Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..
[8] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[9] Daniel Vanderpooten,et al. Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..
[10] Takeo Yamada,et al. Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem , 2008, Comput. Oper. Res..
[11] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .
[12] Arkadi Nemirovski,et al. Robust Convex Optimization , 1998, Math. Oper. Res..
[13] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[14] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .