Michel L. Balinski

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
1993 J jnl
Signature classes of transportation polytopes.
Math. Program.
Michel L. Balinski, Fred J. Rispoli
1991 J jnl
Maximum matchings in bipartite graphs via strong spanning trees.
Networks
Michel L. Balinski, Jaime Gonzalez
1989 J jnl
Algorithms for proportional matrices in reals and integers.
Math. Program.
Michel L. Balinski, Gabrielle Demange
1989 J jnl
An Axiomatic Approach to Proportionality Between Matrices.
Math. Oper. Res.
Michel L. Balinski, Gabrielle Demange
1987 J jnl
Nominations for 1988 elections.
Math. Program.
Michel L. Balinski
1986 J jnl
A competitive (dual) simplex method for the assignment problem.
Math. Program.
Michel L. Balinski
1986 J jnl
On the average length of lexicographic paths.
Math. Program.
Michel L. Balinski, Thomas M. Liebling, A.-E. Nobs
1985 J jnl
Signature Methods for the Assignment Problem.
Oper. Res.
Michel L. Balinski
1978 J jnl
On the reporting of computational experiments.
Math. Program.
Michel L. Balinski
1972 J jnl
A note on harmonious families.
Math. Program.
Michel L. Balinski
1972 J jnl
Some properties of the assignment polytope.
Math. Program.
Michel L. Balinski, Andrew Russakoff
1971 J jnl
The journal.
Math. Program.
Michel L. Balinski, Philip Wolfe