Author:
Goffin Jean-Louis,Luo Zhi-Quan,Ye Yinyu
Reference23 articles.
1. S. Agmon (1954), “The Relaxation Method for Linear Inequalities,” Canadian Journal of Mathematics
6, 382–392.
2. D. S. Atkinson and P. M. Vaidya (1992), A Cutting Plane Algorithm that uses Analytic Centers, University of Illinois at Urbana-Champaign, Urbana, IL 61820, USA.
3. J. V. Burke, A. A. Goldstein, P. Tseng, and Y. Ye (1993), “Translation Cuts for Minimization,” Complexity in Numerical Optimization (Editor: P. M. Pardalos ), World Scientific, 57–73.
4. G. B. Dantzig and P. Wolfe (1961), “The Decomposition Algorithm for Linear Programming,” Econometrica
29, 767–778.
5. J. Elzinga and T. Moore (1975), “A Central Cutting Plane Algorithm for Convex Programming,” Mathematical Programming
8, 134–145.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献