Integer Linear Programming: A Study in Computational Efficiency

Abstract

In this report, twenty-nine integer linear programming problems, raging from very simple to apparently rather difficult, are introduced. The results of running these problems on four different computer codes, involving five distinct algorithms, are presented as both time and iteration data. A brief description of the codes used is also included.