Back to search
An integer linear programming approach to the steiner problem in graphs
Data up to Jan 2025
Published1980
Citations144
References9
Total Citations Per Year
Abstract
References (9)
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Multi-Terminal Network Flows
1961 • 959 citations
The steiner problem in graphs
1971 • 694 citations
Steiner's problem in graphs and its implications
1971 • 344 citations
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
1971 • 128 citations
Set Covering and Involutory Bases
1971 • 63 citations
Cost-minimal trees in directed acyclic graphs
1974 • 47 citations
A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set
1977 • 7 citations
Cited By (0)
Loading...