Integer Programming: Methods, Uses, Computations

TLDR

The author believes that enumeration and specialized approaches are the most effective means to solve practical integer programming problems. The paper aims to present major methods, uses, and computational experience in integer programming, and to allow readers to consult selected sections independently. The authors describe general integer programming algorithms and specialized algorithms for highly structured problems. The authors attempted to compile computational experience, but finding concrete facts proved challenging.

Abstract

This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Included are descriptions of general algorithms for solving linear programs in integers, as well as some special purpose algorithms for use on highly structured problems. This reflects a belief, on the author's part, that various clever methods of enumeration and other specialized approaches are the most efficacious means existent by which to obtain solutions to practical problems. A serious try at gathering computational experience has been made—but facts are difficult to uncover. The paper is written with intent to enable readers to read selected sections without having to read the whole.