A new Lagrangian decomposition approach applied to the integration of refinery planning and crude-oil scheduling

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Marshall L. Fisher · Management Science · 1981 · 2.1K citations

Business, Mathematics, Operations Management +17

The Cutting-Plane Method for Solving Convex Programs

James E. Kelley · Journal of the Society for Industrial and Applied Mathematics · 1960 · 1.5K citations

Natural Sciences, Computer Science, Algorithms +9

The Traveling-Salesman Problem and Minimum Spanning Trees

Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +17

Validation of subgradient optimization

Michael Held, Philip Wolfe, Harlan Crowder · Mathematical Programming · 1974 · 1.4K citations

Natural Sciences, Computer Science, Mathematics +11

The traveling-salesman problem and minimum spanning trees: Part II

Michael Held, Richard M. Karp · Mathematical Programming · 1971 · 1K citations

Natural Sciences, Computer Science, Mathematics +15