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]

@article{Sbihi07,
  title = {A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem},
  author = {Abdelkader Sbihi},
  year = {2007},
  doi = {10.1007/s10878-006-9035-3},
  url = {http://dx.doi.org/10.1007/s10878-006-9035-3},
  tags = {search},
  researchr = {https://researchr.org/publication/Sbihi07},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {13},
  number = {4},
  pages = {337-351},
}