A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA · 1981 · 2K citations

Natural Sciences, Mathematics, Algorithms +8

A Selection Problem of Shared Fixed Costs and Network Flows

John Rhys · Management Science · 1970 · 238 citations

Natural Sciences, Mathematics, Operations Management +17

Maximal Closure of a Graph and Applications to Combinatorial Problems

Jean‐Claude Picard · Management Science · 1976 · 233 citations

Natural Sciences, Mathematics, Operations Management +12

Minimizing symmetric submodular functions

Maurice Queyranne · Mathematical Programming · 1998 · 177 citations

Natural Sciences, Computer Science, Mathematics +11

Testing membership in matroid polyhedra

William H. Cunningham · Journal of Combinatorial Theory Series B · 1984 · 159 citations

Computing, Computer Science, Computational Geometry +2