On the Assignment Polytope

descriptionPublicationkeyboard_double_arrow_right Article 01 Oct 1974 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Review, volume 16, pages 516-525 (issn: 0036-1445, eissn: 1095-7200,

Copyright policy )

Authors: Balinski, M. L.; Russakoff, Andrew;

doi: 10.1137/1016083

On the Assignment Polytope

- Summary
- Subjects
- Metrics

Abstract

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.

Keywords

Programming involving graphs or networks

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	75
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%