Are there NP COMPLETE problems that are "easy" in practice?
Honestly, SAT seems pretty easy in practice. SAT solvers are routinely used on instances with millions of variables that arise in model checking against formal specifications.