Signature Methods for the Assignment Problem (1985)
by
Author(s) M. L. Balinski
,
M. L. Balinski
| Venue: | Operations Research |
| Citations: | 19 - 0 self |
BibTeX
@ARTICLE{Balinski85signaturemethods,
author = {Author(s) M. L. Balinski and M. L. Balinski},
title = {Signature Methods for the Assignment Problem},
journal = {Operations Research},
year = {1985},
pages = {527--537}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research.
Citations
| 146 | Algorithms for the Assignment and Transportation Problems - Munkres |
| 24 | A network simplex method - Cunningham - 1976 |
| 15 | Theoretical properties of the network simplex method - Cunningham - 1979 |
| 11 | A primal method for the assignment and transportation problems”, Management Sciences - Balinski, Gomory - 1964 |
| 11 | A Polynomial Simplex Method for the Assignment Problem - Hung - 1983 |
| 10 | The Hirsh conjecture for dual transportation polyhedra - Balinski - 1984 |
| 6 | Efficient Dual Simplex Algorithms for the Assignment Problem (preprint - GOLDFARB |
| 5 | The Alternating Path Basis Algorithm for Assignment Problems - BARR, GLOVER, et al. - 1977 |
| 1 | Signatures des points extremes du polyedre dual du probleme de transport - BALINSKI - 1983 |
| 1 | Private letter of Sept. 19. (I am indebted also for several suggestions concerning the manuscript in addition to the method of counting - CUNNINGHAM - 1983 |
| 1 | Private communication - GOLDFARB - 1983 |
