Before revision:  We also describe novel features for predicting algorithm runtime for the propositional satisfiability (SAT),  mixed integer programming (MIP) , and travelling salesperson (TSP) problems.
After revision:  We also comprehensively describe new and existing features for predicting algorithm runtime for the propositional satisfiability (SAT), mixed integer programming (MIP) , and travelling salesperson (TSP) problems.