Concepedia

A comparison of Steiner tree relaxations

Tobias Polzin, Siavash Vahdati Daneshmand

Discrete Applied Mathematics · 2001 · 75 citations · 14 references

DOI

Concepts

References

14

Integer Programming Formulation of Traveling Salesman Problems

Casey Miller, A. W. Tucker, R. A. Zemlin · Journal of the ACM · 1960 · 2K citations · Full text

, , +12

Matroids and the greedy algorithm

Jack Edmonds · Mathematical Programming · 1971 · 878 citations

, , +11

A dual ascent approach for steiner tree problems on a directed graph

Richard T. Wong · Mathematical Programming · 1984 · 359 citations

, , +13

Solving Steiner tree problems in graphs to optimality

Thorsten Koch, Alexander Martín · Networks · 1998 · 250 citations

, , +17

Survivable networks, linear programming relaxations and the parsimonious property

Michel X. Goemans, Dimitris Bertsimas · Mathematical Programming · 1993 · 196 citations · Full text

, , +14