Non Delayed Relax-and-Cut Algorithms

European journal of operational research

Technological Forecasting and Social Change · 1990 · 5.4K citations

Operational Management, Management, Systems Engineering +3

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5K citations · Full text

Mathematical Programming, Abstract Algebra, Engineering +21

Shortest Connection Networks And Some Generalizations

R. C. Prim · Bell System Technical Journal · 1957 · 4.5K citations

Mathematical Programming, Directed Graph, Engineering +20

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Marshall L. Fisher · Management Science · 1981 · 2.1K citations

Mathematical Programming, Numerical Analysis, Branch-and-bound Algorithm +19

A new approach to the maximum-flow problem

Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text

Mathematical Programming, Numerical Analysis, Directed Graph +25