The multidimensional 0-1 knapsack problem: An overview
By Arnaud Fréville. European Journal of Operational Research, 2004
489 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/881ba11f64582f3c1813410cccc8948131cde528
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Dusist Niyato
- Zhu Han
- Dong In Kim
- Ping Wang
- Xiao Lu
- Madhukar R. Korupolu
- Dushmanta Mohapatra
- Aameek Singh
In Industrial and Manufacturing Engineering
- Ping Wang
- Zhu Han
- Xiao Lu
- Dusist Niyato
- Madhukar R. Korupolu
- Dushmanta Mohapatra
- Aameek Singh
- Dong In Kim
Citations in the corpus
- Server-storage virtualization: Integration and load balancing in data centers (2008, methodology): “The VectorDot algorithm is inspired by the successful Toyoda heuristic [18] for multidimensional knapsacks [19].”
- Wireless Charging Technologies: Fundamentals, Standards, and Network Applications (2015, methodology): “By applying constraint conversion and constraint reduction techniques, the authors showed that the original problem can be transformed into two traditional problems, namely multidimensional 0/1 knapsack problem [341] and Fermat-Weber problem [342].”