Incollection,
On the History of Combinatorial Optimization (Till 1960)
Discrete Optimization, volume 12 of Handbooks in Operations Research and Management Science, Elsevier, (2005)
DOI: 10.1016/S0927-0507(05)12001-5
Abstract
Publisher Summary This chapter traces the history of combinatorial optimization. As a coherent mathematical discipline, combinatorial optimization is relatively young. Linear programming forms the hinge in the history of combinatorial optimization. Its initial conception by Kantorovich and Koopmans was motivated by combinatorial applications—in particular, in transportation and transshipment. The assignment problem is one of the first investigated combinatorial optimization problems. A breakthrough in solving the assignment problem came when Dantzig showed that the assignment problem can be formulated as a linear programming problem that automatically has an integer optimum solution. The reason is a theorem of Birkhoff 1946 stating that the convex hull of the permutation matrices is equal to the set of doubly stochastic matrices—nonnegative matrices in which each row and column sum is equal to 1. Therefore, minimizing a linear functional over the set of doubly stochastic matrices (which is a linear programming problem) gives a permutation matrix, being the optimum assignment.
