论文信息 - On an Integer Program for a Delivery Problem

On an Integer Program for a Delivery Problem

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.

M. Balinski | R. Quandt

[1] J. Roth. Algebraic topological methods for the synthesis of switching systems. I , 1958 .

[2] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .

[3] R. Z. Norman,et al. An algorithm for a minimum cover of a graph , 1959 .

[4] D. R. Fulkerson,et al. Widths and heights of (0,1)-matrices. , 1961 .

[5] J. Edmonds. Covers and packings in a family of sets , 1962 .