| ||||||||||||||||||||||||||||
[DR99] A Parallel Branch-and-Bound Algorithm using a Semidefinite Programming Relaxation for the Vertex-Cover ProblemConférence Internationale avec comité de lecture : ECCO XII, Bandol, France, January 1999,
motcle:
Collaboration:
LIPN
BibTeX
|
||||||||||||||||||||||||||||