NETWORK FLOW PROBLEMS WITH ONE SIDE CONSTRAINT - A COMPARISON OF 3 SOLUTION METHODS

被引：16

作者：

BELLINGSEIB, K

MEVERT, P

MULLER, C

机构：

[1] Freie Univ Berlin, Berlin, West Ger, Freie Univ Berlin, Berlin, West Ger

来源：

COMPUTERS & OPERATIONS RESEARCH | 1988年 / 15卷 / 04期

关键词：

D O I：

10.1016/0305-0548(88)90022-6

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：381 / 394

页数：14

共 50 条

[31] A COMPARISON OF STOCHASTIC AND DIRECT METHODS FOR THE SOLUTION OF SOME SPECIAL PROBLEMS
THOMAS, LH
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF AMERICA, 1953, 1 (04): : 181 - 186
[32] Massively parallel solution of large scale network flow problems
DeLeone, R
Merelli, E
Buti, S
NONLINEAR OPTIMIZATION AND APPLICATIONS, 1996, : 49 - 59
[33] Comparison of two projection methods for the solution of frictional contact problems
Shougui Zhang
Ruisheng Ran
Boundary Value Problems, 2019
[34] A Solution Approach to the Nonconvex Piecewise Linear Network Flow Problems
Bai, Yu
Xu, Zhiming
Wang, Shuning
2018 13TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2018, : 1332 - 1337
[35] The global error of one-step solution methods for stiff problems
Novikov E.A.
Russian Mathematics, 2011, 55 (6) : 68 - 75
[36] RELAXATION METHODS FOR NETWORK FLOW PROBLEMS WITH CONVEX ARC COSTS
BERTSEKAS, DP
HOSEIN, PA
TSENG, P
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (05) : 1219 - 1243
[37] INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
KATSURA, R
FUKUSHIMA, M
IBARAKI, T
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1989, 32 (02) : 174 - 199
[38] Approximate subgradient methods for nonlinearly constrained network flow problems
Mijangos, E
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2006, 128 (01) : 167 - 190
[39] DISTRIBUTED ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS
BERTSEKAS, DP
ELBAZ, D
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1987, 25 (01) : 74 - 85
[40] Combinatorial interior point methods for generalized network flow problems
Goldfarb, D
Lin, YQ
MATHEMATICAL PROGRAMMING, 2002, 93 (02) : 227 - 246

← 1 2 3 4 5 →