On an Integer Program for a Delivery Problem

Abstract

An actual truck delivery problem of general applicability is stated as an integer program. The successful computational performance of Gomory's “cutting plane” algorithm for a set of nine particular problems is discussed. Finally, the structure of the general problem is shown to be a natural generalization of covering problems of graph theory.