Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Balinski et al. (1964) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: