A hard integer program made easy by lexicography
A small but notoriously hard integer program formulated by Donald Knuth fifty years ago is solved by three versions of a lexicographic algorithm using Gomory cuts. The lexicographic cutting plane algorithms are faster than CPLEX on this problem by a factor of at least 10.
gomory cuts cutting plane methods degeneracy in linear programming lexicographic dual simplex computational analysis