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 describe novel features for predicting algorithm runtime for the propositional satisfiability (SAT), travelling salesperson (TSP) and mixed integer programming (MIP) , and travelling salesperson (TSP) problems.