nAlgorithms
are predictable
nEmpirical
hardness can be studied in a disciplined way
nOnce
again: Structure matters!
nUniform
distributions aren’t the best testbeds
nConstraint
graphs are very useful
nHypothesis:
good heuristics make good features (e.g. LP)
nOur
methodology is general and can be applied to other
problems!
n