Solving the multiscenario Max-Min Knapsack problem exactly with column generation and branch-and-bound
暂无分享,去创建一个
[1] Cláudio Alves,et al. A Column Generation Approach for the Bi-objective Max-min Knapsack Problem , 2012, ICORES.
[2] Saïd Hanafi,et al. Hybrid approaches for the two-scenario max-min knapsack problem , 2012, Int. Trans. Oper. Res..
[3] Daniel Vanderpooten,et al. Approximation of min-max and min-max regret versions of some combinatorial optimization problems , 2007, Eur. J. Oper. Res..
[4] Jonathan M. Thompson,et al. An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem , 2012, Comput. Oper. Res..
[5] Abdelkader Sbihi,et al. A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem , 2010, Eur. J. Oper. Res..
[6] Takeo Yamada,et al. Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem , 2008, Comput. Oper. Res..
[7] Adam Kurpisz,et al. Approximating the min-max (regret) selecting items problem , 2013, Inf. Process. Lett..
[8] Takeo Yamada,et al. A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem , 2009, Int. J. Comput. Math..
[9] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[10] Gang Yu,et al. On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications , 1996, Oper. Res..
[11] David Pisinger,et al. Budgeting with bounded multiple-choice constraints , 2001, Eur. J. Oper. Res..
[12] Hiroshi Iida. A Note on the Max-Min 0-1 Knapsack Problem , 1999, J. Comb. Optim..