The ellipsoid method and its consequences in combinatorial optimization

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

Natural Sciences, Computer Science, Mathematics +6

Maximal Flow Through a Network

L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text

Public Health, Transportation Planning, Transport +16

Polynomial algorithms in linear programming

Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 2K citations

Computing, Computer Science, Mathematics +10

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

Natural Sciences, Computer Science, Mathematics +8

On the Shannon capacity of a graph

László Lovász · IEEE Transactions on Information Theory · 1979 · 1.7K citations

Computing, Computer Science, Mathematics +8