A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

TSPLIB—A Traveling Salesman Problem Library

Gerhard Reinelt · INFORMS Journal on Computing · 1991 · 2.6K citations

Natural Sciences, Computer Science, Algorithms +11

Odd Minimum Cut-Sets and <i>b</i>-Matchings

Manfred Padberg, M. R. Rao · Mathematics of Operations Research · 1982 · 405 citations

Natural Sciences, Computer Science, Mathematics +17

The precedence-constrained asymmetric traveling salesman polytope

Egon Balas, Matteo Fischetti, William R. Pulleyblank · Mathematical Programming · 1995 · 147 citations

Natural Sciences, Computer Science, Mathematics +11

Hamiltonian Path Problems in the On-line Optimization of Flexible Manufacturing Systems

Norbert Ascheuer · 1996 · 140 citations

Engineering, Industrial Engineering, Manufacturing Engineering +17

An efficient algorithm for the minimum capacity cut problem

Manfred Padberg, Giovanni Rinaldi · Mathematical Programming · 1990 · 131 citations

Computing, Computer Science, Algorithms +7