In 1960, the famed computer scientist Don Knuth wrote a technical paper in which he considered an integer programming model for minimizing memory access latency of an IBM 650. It included 51 variables and 43 constraints. Knuth ran Gomory’s algorithm on an IBM 650 with less than 10K of memory, but was unable to find an optimal solution. In 1995 Dimitris Alevras successfully found the optimum value of 22,996 using CPLEX on a SPARCstation 5 and it took hours. These days open source MIP solvers are able to find an optimal solution in tenths of a second. Link