Relaxation Method for Linear Programs with Side Constraints
暂无分享,去创建一个
Decision Systems. | Paul. Tseng | Dimitri P. Bertsekas | D. Bertsekas | P. Tseng | Decision Systems.
[1] T. L. Magnanti. OPTIMIZATION FOR SPARSE SYSTEMS , 1976 .
[2] Thomas L. Magnanti,et al. Deterministic network optimization: A bibliography , 1977, Networks.
[3] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[4] Arjang A. Assad,et al. Multicommodity network flows - A survey , 1978, Networks.
[5] Jeff L. Kennington,et al. A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..
[6] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[7] R. Rockafellar. MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .
[8] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[9] Dimitri P. Bertsekas,et al. A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..
[10] Paul Tseng,et al. Relaxation methods for monotropic programming problems , 1986 .
[11] Paul Tseng,et al. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..
[12] R. Rockafellar. The Elementary Vectors of a Subspace of RiY , 2022 .