News
The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard problem that has many real-time applications. However, owing to its complexity, finding computationally efficient ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results