Concepedia
Annals of Operations Research · 2005 · 47 citations · 35 references
ComputingComputer EngineeringComputer ScienceAlgorithmsOptimizationApproximation AlgorithmsConvex RelaxationsGraph Relaxation
35
European journal of operational research
Technological Forecasting and Social Change · 1990 · 5.4K citations
Management, Operations Management, Operations Research +1
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
Natural Sciences, Mathematics, Algebra +11
Shortest Connection Networks And Some Generalizations
R. C. Prim · Bell System Technical Journal · 1957 · 4.6K citations
Computing, Computer Science, Interconnection Networks +9
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Marshall L. Fisher · Management Science · 1981 · 2.1K citations
Business, Mathematics, Operations Management +17
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text
Computing, Computer Science, Algorithms +16