Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gallai, T.
1958.
Maximum-Minimum Sätze über Graphen.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 9,
Issue. 3-4,
p.
395.
Fulkerson, D. R.
1959.
A Network-Flow Feasibility Theorem and Combinatorial Applications.
Canadian Journal of Mathematics,
Vol. 11,
Issue. ,
p.
440.
1959.
The Theory of Infinite Games.
p.
371.
1959.
Matrix Games, Programming, and Mathematical Economics.
p.
415.
Gallai, T.
1959.
Über reguläre Kettengruppen.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 10,
Issue. 1-2,
p.
227.
Ryser, H. J.
1960.
Matrices of zeros and ones.
Bulletin of the American Mathematical Society,
Vol. 66,
Issue. 6,
p.
442.
Ryser, H. J.
1960.
Traces of Matrices of Zeros and Ones.
Canadian Journal of Mathematics,
Vol. 12,
Issue. ,
p.
463.
Kelley, J. E.
1961.
Techniques for storage allocation algorithms.
Communications of the ACM,
Vol. 4,
Issue. 10,
p.
449.
von Boventer, Edwin
1961.
THE RELATIONSHIP BETWEEN TRANSPORTATION COSTS AND LOCATION RENT IN TRANSPORTATION PROBLEMS.
Journal of Regional Science,
Vol. 3,
Issue. 2,
p.
27.
Minty, G.
1961.
Solving Steady-State Nonlinear Networks of 'Monotone' Elements.
IRE Transactions on Circuit Theory,
Vol. 8,
Issue. 2,
p.
99.
Fulkerson, D. R.
1961.
An Out-of-Kilter Method for Minimal-Cost Flow Problems.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 9,
Issue. 1,
p.
18.
Fulkerson, D. R.
and
Ryser, H. J.
1961.
Widths and Heights of (0,1) -Matrices.
Canadian Journal of Mathematics,
Vol. 13,
Issue. ,
p.
239.
Cederbaum, I.
1962.
On optimal operation of communication nets.
Journal of the Franklin Institute,
Vol. 274,
Issue. 2,
p.
130.
Gomory, R. E.
and
Hu, T. C.
1962.
An Application of Generalized Linear Programming to Network Flows.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 10,
Issue. 2,
p.
260.
Dulmage, A. L.
and
Mendelsohn, N. S.
1962.
On the inversion of sparse matrices.
Mathematics of Computation,
Vol. 16,
Issue. 80,
p.
494.
Yau, S.
1962.
Synthesis of Radio-Communication Nets.
IRE Transactions on Circuit Theory,
Vol. 9,
Issue. 1,
p.
62.
Hakimi, S.
1962.
Simultaneous Flows Through a Communication Network.
IRE Transactions on Circuit Theory,
Vol. 9,
Issue. 2,
p.
169.
Dulmage, A. L.
and
Mendelsohn, N. S.
1963.
Two Algorithms for Bipartite Graphs.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 11,
Issue. 1,
p.
183.
Chien, R.
Gomory, R.
and
Hu, T.
1964.
VII. Communication Networks.
IEEE Transactions on Circuit Theory,
Vol. 11,
Issue. 1,
p.
19.
Yau, S.S.
1964.
The sensitivity of a traffic network.
Journal of the Franklin Institute,
Vol. 278,
Issue. 6,
p.
371.