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 条

[1] Solution methods for nonconvex network flow problems
Bell, GJ
Lamar, BW
NETWORK OPTIMIZATION, 1997, 450 : 32 - 50
[2] MODELING THE SATELLITE PLACEMENT PROBLEM AS A NETWORK FLOW PROBLEM WITH ONE SIDE CONSTRAINT
SPALTI, SB
LIEBLING, TM
OR SPEKTRUM, 1991, 13 (01) : 1 - 14
[3] On a Minimum Ratio Cancelling Algorithm of the Problem of a Minimal Network Flow with One Side Constraint
Nikolova, Mariana
CYBERNETICS AND INFORMATION TECHNOLOGIES, 2007, 7 (03) : 41 - 47
[4] Comparison of iterative and direct solution methods for viscous flow problems
van Dam, C.P., 1600, (27):
[5] A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
Kilby P.
Prosser P.
Shaw P.
Constraints, 2000, 5 (4) : 389 - 414
[6] Comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
Kilby, Philip
Prosser, Patrick
Shaw, Paul
Constraints, 2000, 5 (04) : 389 - 414
[7] COMPARISON OF ITERATIVE AND DIRECT SOLUTION METHODS FOR VISCOUS-FLOW PROBLEMS
VANDAM, CP
HAFEZ, M
AIAA JOURNAL, 1989, 27 (10) : 1459 - 1461
[8] HIERARCHICAL SOLUTION OF NETWORK FLOW PROBLEMS
IYER, AV
JARVIS, JJ
RATLIFF, HD
NETWORKS, 1990, 20 (06) : 731 - 752
[9] Algorithms for Solving the Problem for a Minimal Network Circulation with One Side Constraint
Nikolova, Mariana
CYBERNETICS AND INFORMATION TECHNOLOGIES, 2008, 8 (04) : 13 - 19
[10] ONE CLASS OF MULTIEXTREMUM PROBLEMS AND THEIR SOLUTION METHODS
ZAK, JA
AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (05): : 41 - 47

← 1 2 3 4 5 →