| ||||||||||||||||||||||||||||
[CRV00] A parallel Branch-and-Bound algorithm using a semidefinite programming relaxation for the maximum independent set problemConférence Nationale avec comité de lecture : ROADEF'2000, Nantes, January 2000,
motcle:
Collaboration:
LIPN
BibTeX
|
||||||||||||||||||||||||||||