Validation of subgradient optimization
Data up to Jan 2025
Total Citations Per Year
Abstract
References (23)
Convex Analysis
1970 • 9,645 citations
Flows in networks
1962 • 4,199 citations
Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV
1969 • 2,901 citations
The Traveling-Salesman Problem and Minimum Spanning Trees
1970 • 1,431 citations
Solution of a Large-Scale Traveling-Salesman Problem
2009 • 1,314 citations
Optimization Theory for Large Systems
1970 • 1,265 citations
A Dynamic Programming Approach to Sequencing Problems
1962 • 1,212 citations
Optimization Theory of Large Systems
1971 • 1,129 citations
The traveling-salesman problem and minimum spanning trees: Part II
1971 • 1,010 citations
The Relaxation Method for Linear Inequalities
1954 • 562 citations
Minimization of unsmooth functionals
1969 • 560 citations
1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem
1953 • 480 citations
The Relaxation Method for Linear Inequalities
1954 • 454 citations
Elements of Large-Scale Mathematical Programming Part I: Concepts
1970 • 258 citations
A Heuristic Approach to Solving Travelling Salesman Problems
1964 • 207 citations
Elements of large-scale mathematical programming
1969 • 206 citations
Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability.
1952 • 172 citations
Constructive Duality in Integer Programming
1974 • 74 citations
Proceedings of the Princeton Symposium on Mathematical Programming
1972 • 53 citations
Steepest Ascent for Large Scale Linear Programs
1972 • 41 citations
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
1972 • 27 citations
Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals
1971 • 15 citations
Large scale optimization and the relaxation method
1972 • 12 citations