A Potential Reduction Algorithm Allowing Column Generation
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (1) , 7-20
- https://doi.org/10.1137/0802002
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingPublished by Springer Nature ,2006
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- Cutting planes and column generation techniques with the projective algorithmJournal of Optimization Theory and Applications, 1990
- A “build-down” scheme for linear programmingMathematical Programming, 1990
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Karmarkar's algorithm and the ellipsoid methodOperations Research Letters, 1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- La mèthode des centres dans un espace topologiqueNumerische Mathematik, 1966
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- Partitions of mass-distributions and of convex bodies by hyperplanesPacific Journal of Mathematics, 1960