In Laurence Wolsey's Integer Programming, he presents a well-known procedure for deriving valid inequalities (VI) suitable for integer and mixed integer linear problems (see Section 8.3, and also Ch 9).
In the application-oriented literature, I've often seen authors present a MILP formulation then follow it up with VIs they have derived and found to be helpful in the problem, usually accompanied with experimental results (robust or not) to show the utility of the VI. (For clarification, I'm referring to VIs authors suggest adding to the formulation, not user-generated cuts derived and/or added during the solution procedure. Modern solvers have many powerful tricks for both pre-processing and during the solution process, including powerful cutting plane approaches.)
Question: With the extensive
pre-processing options available with commercial solvers like CPLEX or Gurobi, is this still worth doing? If yes, what are the best practices for testing and convincing oneself a VI (or set of VIs) is worth the trouble?
Clarification: Based on the comments, by "extensive options" I mean the powerful pre-processing options and the in-process bag-o-tricks used by solvers. Why mention pre-processing (as a commenter asks)? For one, because pre-processing options exist. Second, in the literature I've seen authors recommend a certain level based on empirical testing.
 Wolsey, Laurence A. 1998. Integer Programming. Wiley: New York. ISBN 0471283665.