| ||||||||||||||||||||||||||||||||||||||||
[QST09] Exact solution method to solve large scale integer quadratic multidimensional knapsack problemsRevue Internationale avec comité de lecture : Journal Journal of Combinatorial Optimization, vol. 17(2), pp. 157-167, 2009, (doi:10.1007/s10878-007-9105-1)
motcle:
Résumé:
In this paper we develop a branch-and-bound algorithm to exactly solve the separable quadratic multi-knapsack problem (QMKP), using a tight upper bound for (QMKP) wich is derived from a linearization and a surrogate relaxation.
Equipe:
oc
Collaboration:
LIA
BibTeX
|
||||||||||||||||||||||||||||||||||||||||