A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem
暂无分享,去创建一个
[1] J. Pang,et al. A min-max resource allocation problem with substitutions , 1989 .
[2] Paolo Toth,et al. Heuristic algorithms for the multiple knapsack problem , 1981, Computing.
[3] G. Dantzig. Discrete-Variable Extremum Problems , 1957 .
[4] H. Luss. Minimax resource allocation problems: Optimization and parametric analysis , 1992 .
[5] M. Moser,et al. An Algorithm for the Multidimensional Multiple-Choice Knapsack Problem , 1997 .
[6] R. Nauss. The 0–1 knapsack problem with multiple choice constraints☆ , 1978 .
[7] David Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .
[8] Y. Toyoda. A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .
[9] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[10] Mhand Hifi,et al. A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem , 2006, Comput. Optim. Appl..
[11] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[12] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[13] Mhand Hifi,et al. Heuristic algorithms for the multiple-choice multidimensional knapsack problem , 2004, J. Oper. Res. Soc..
[14] David Pisinger,et al. A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..
[15] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[16] Lei Chen,et al. Building an Adaptive Multimedia System using the Utility Model , 1999, IPPS/SPDP Workshops.
[17] Kin F. Li,et al. Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..
[18] Gérard Plateau,et al. An algorithm for the solution of the 0–1 knapsack problem , 2005, Computing.
[19] S. Martello,et al. A New Algorithm for the 0-1 Knapsack Problem , 1988 .
[20] Prabhakant Sinha,et al. The Multiple-Choice Knapsack Problem , 1979, Oper. Res..
[21] Wei Shih,et al. A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .