论文信息 - AN -OUT-OF-KILTER METHODFOR MONOTROPIC PROGRAMMING - 字舞流文

AN -OUT-OF-KILTER METHODFOR MONOTROPIC PROGRAMMING

Paul Tseng | P. Tseng

[1] D. Bertsekas,et al. Relaxation methods for network flow problems with convex arc costs , 1987 .

[2] R. Meyer,et al. A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems , 1999, Comput. Optim. Appl..

[3] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[5] Paul Tseng,et al. An ε-Relaxation Method for Separable Convex Cost Network Flow Problems , 1997, SIAM J. Optim..

[6] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .

[7] Clóvis C. Gonzaga,et al. Path-Following Methods for Linear Programming , 1992, SIAM Rev..

[8] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .

[9] John M. Mulvey,et al. OR Practice - Large-Scale Nonlinear Network Models and Their Application , 1989, Oper. Res..

[10] Ravindra K. Ahuja,et al. Applications of network optimization , 1992 .

[11] Paul Tseng,et al. Relaxation methods for monotropic programs , 1990, Math. Program..

[12] G. Minty,et al. Solving Steady-State Nonlinear Networks of 'Monotone' Elements , 1961 .