An efficient algorithm for the minimum capacity cut problem

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

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Manfred Padberg, Giovanni Rinaldi · SIAM Review · 1991 · 1.1K citations

Computing, Computer Science, Algorithms +16

Multi-Terminal Network Flows

Ralph E. Gomory, T. C. Hu · Journal of the Society for Industrial and Applied Mathematics · 1961 · 948 citations

Computing, Communication, Computer Science +9

A note on the maximum flow through a network

P. Eliáš, Amiel Feinstein, Chris Shannon · IEEE Transactions on Information Theory · 1956 · 453 citations

Natural Sciences, Industrial Engineering, Algorithms +13

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Manfred Padberg, Giovanni Rinaldi · Operations Research Letters · 1987 · 392 citations

Natural Sciences, Computer Science, Mathematics +11