References
M.L. Balinski and A. Russakoff, Some properties of the assignment polytope,Mathematical Programming 3 (1972) 257–258.
M.L. Balinski and A. Russakoff, On the assignment polytope,SIAM Review 16 (1974) 516–525.
R.A. Brualdi and P.M. Gibson, The convex polyhedron of doubly stochastic matrices: I. Applications of the permanent function,Journal of Combinatorial Theory (A), to appear.
R.A. Brualdi and P.M. Gibson, The convex polyhedron of doubly stochastic matrices: II. The graph ofΩ n, Journal of Combinatorial Theory (B), to appear.
R.A. Brualdi and P.M. Gibson, The convex polyhedron of doubly stochastic matrices: III. Affine and combinatorial properties ofΩ n,Journal of Combinatorial Theory (A), to appear.
H. Minc, On lower bounds for permanents of (0, 1)-matrices,Proceedings of the American Mathematical Society 22 (1969) 117–123.
Author information
Authors and Affiliations
Additional information
Research partially supported by National Science Foundation Grant No. GP-37978X.
Research conducted while on sabbatical leave at the University of Wisconsin.
Rights and permissions
About this article
Cite this article
Brualdi, R.A., Gibson, P.M. The assignment polytope. Mathematical Programming 11, 97–101 (1976). https://doi.org/10.1007/BF01580375
Issue Date:
DOI: https://doi.org/10.1007/BF01580375