KEY TO TEST RESULT TABLES Rows: ILOG SOLVER IlcMinimize, IlcGenerate 1stUnbound using IlcChooseFirstUnboundInt MinSize using IlcChooseMinSizeInt BestGen IlcMinimize, IlcBestGenerate 1stUnbound using IlcChooseFirstUnboundInt MinSize using IlcChooseMinSizeInt ILOG PLANNER Up, Most using IlcTryUpwardFirst, MostNotInteger Dn, Most using IlcTryDownwardFirst, MostNotInteger Up, Least using IlcTryUpwardFirst, LeastNotInteger Dn, Least using IlcTryDownwardFirst, LeastNotInteger OSL pretype 1 0-1 variable heuristics at start only pretype 2 0-1 variable heuristics at every node CPLEX Node selection best bound, with var selection ... Most most fractional Least least fractional Pseudo using pseudocosts Strong using "strong branching" Best est Node selection best estimate, with var selection ... Most most fractional Least least fractional Pseudo using pseudocosts Strong using "strong branching" Columns: Time Execution time (computer for ILOG Solver/Planner is about 4 TIMES FASTER) ChPt Choice points or branch-and-bound nodes Iter Simplex iterations