We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive con- straints, and also present a new, substantially improved disjunctive cut generator. Employed together with an efficient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experience with the most difficult problems in the MIPLIB library.