On the Assignment Polytope
Michel Balinski, Andrew Russakoff · SIAM Review · 1974
An expository, completely elementary and self-contained account is given describing several properties of the constraint polytope of the assignment problem. In particular, it is shown that the “Hirsch conjecture” holds, and that to go from any one extreme point to any other, at most 2 extreme edges need to be traversed.