A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Integer programming

1972 • 3,508 citations

The Traveling-Salesman Problem and Minimum Spanning Trees

1970 • 1,431 citations

Validation of subgradient optimization

1974 • 1,360 citations

The traveling-salesman problem and minimum spanning trees: Part II

1971 • 1,010 citations

Optimum branchings

1967 • 622 citations

Packing rooted directed cuts in a weighted directed graph

1974 • 111 citations

Computing minimum spanning trees efficiently

1972 • 72 citations

Developments in Operations Research

1973 • 71 citations

A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation

1977 • 53 citations

Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems

1977 • 47 citations

The Shortest Hamiltonian Chain of a Graph

1970 • 42 citations