conference paper
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
2003
Principles and Practice of Constraint Programming – CP 2003
Type
conference paper
Author(s)
Eisenberg, Carlos
Date Issued
2003
Published in
Principles and Practice of Constraint Programming – CP 2003
Series title/Series vol.
Lecture Notes in Computer Science; 2833
Start page
822
End page
826
Written at
EPFL
EPFL units
Available on Infoscience
December 13, 2006
Use this identifier to reference this record