Concepedia

Survivable networks, linear programming relaxations and the parsimonious property

Michel X. Goemans, Dimitris Bertsimas

Mathematical Programming · 1993 · 196 citations · 30 references

DOIFull text

Open access

Concepts

References

30

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

, , +11

Shortest Connection Networks And Some Generalizations

R. C. Prim · Bell System Technical Journal · 1957 · 4.6K citations

, , +9

Branch-and-Bound Methods: A Survey

Eugene L. Lawler, Derek Wood · Operations Research · 1966 · 2K citations

, , +14

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

, , +8

P-Complete Approximation Problems

Sartaj Sahni, Teofilo F. Gonzalez · Journal of the ACM · 1976 · 1.7K citations · Full text

, , +17