A branch-and-cut algorithm for capacitated network design problems

Integer and Combinatorial Optimization

H. P. Williams, George L. Nemhauser, Laurence A. Wolsey · Journal of the Operational Research Society · 1990 · 5.6K citations

Natural Sciences, Mathematics, Algorithms +11

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

Edge-Disjoint Spanning Trees of Finite Graphs

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 805 citations

Natural Sciences, Mathematics, Combinatorics +7

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

W. T. Tutte · Journal of the London Mathematical Society · 1961 · 669 citations

Natural Sciences, Computer Science, Mathematics +7

A Computational Study of Search Strategies for Mixed Integer Programming

Jeff Linderoth, Martin Savelsbergh · INFORMS journal on computing · 1999 · 364 citations

Natural Sciences, Computer Science, Mathematics +16