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

Abdelkader Sbihi. A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. J. Comb. Optim., 13(4):337-351, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.