| ||||||||||||||||||||||||||||
[QST05a] Comparison of different branch-and-bound for a quadratic separable multi-knapsack problemConférence Internationale avec comité de lecture : ALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France, January 2005,
motcle:
Collaboration:
LIA
BibTeX
|
||||||||||||||||||||||||||||