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.
No takes yet. Share an insight, caveat, or question.
Balinski et al. (1974) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: