Weighted k‐cardinality trees: Complexity and polyhedral structure

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Shortest Connection Networks And Some Generalizations

1957 • 4,371 citations

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

1993 • 56 citations

Recursive analysis of network reliability

1973 • 52 citations

Facets of two Steiner arborescence polyhedra

1991 • 35 citations

The Fixed-Outdegree 1-Arborescence Polytope

1992 • 22 citations