A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
暂无分享,去创建一个
[1] Abraham P. Punnen,et al. Constrained Matroidal Bottleneck Problems , 1995, Discret. Appl. Math..
[2] David Pisinger,et al. A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..
[3] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[4] J. Pang,et al. A min-max resource allocation problem with substitutions , 1989 .
[5] Abdelkader Sbihi,et al. A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem , 2007, J. Comb. Optim..
[6] Günther Raidl,et al. A Complete Archive Genetic Algorithm for the Multidimensional Knapsack Problem , 2008 .
[7] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[8] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Ralph E. Steuer. Multiple Criteria Optimization: Theory, Computation, And Application (Wiley Series In Probability And Statistics) By Ralph E. Steuer , 2008 .
[11] Christopher S. Tang. A Max-Min Allocation Problem: Its Solutions and Applications , 1988, Oper. Res..
[12] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[13] Gabriel R. Bitran,et al. Linear multiple objective programs with zero–one variables , 1977, Math. Program..
[14] Gang Yu,et al. On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications , 1996, Oper. Res..
[15] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[16] Arnaud Fréville,et al. The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool , 1996, J. Heuristics.
[17] Paolo Toth,et al. New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..
[18] David Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .
[19] J. G. Ecker,et al. Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming , 1981 .
[20] H. Luss. Minimax resource allocation problems: Optimization and parametric analysis , 1992 .
[21] Marc Despontin,et al. Multiple Criteria Optimization: Theory, Computation, and Application, Ralph E. Steuer (Ed.). Wiley, Palo Alto, CA (1986) , 1987 .
[22] Mhand Hifi,et al. A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..
[23] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[24] Gérard Plateau,et al. An algorithm for the solution of the 0–1 knapsack problem , 2005, Computing.
[25] Mhand Hifi,et al. An Efficient Algorithm for the Knapsack Sharing Problem , 2002, Comput. Optim. Appl..
[26] Takeo Yamada,et al. Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem , 2008, Comput. Oper. Res..
[27] Takeo Yamada,et al. Some exact algorithms for the knapsack sharing problem , 1998, Eur. J. Oper. Res..
[28] J. Randall Brown. Solving knapsack sharing problems with general tradeoff functions , 1991, Math. Program..
[29] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[30] Hiroshi Iida. A Note on the Max-Min 0-1 Knapsack Problem , 1999, J. Comb. Optim..