×
  • A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

    Sbihi A.

Click on cover to enlarge.
0 - 1Hours to read