-
1
-
-
0003515463
-
-
Prentice Hall Englewood Cliffs
-
Ahuja RK, Magnati TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnati, T.L.2
Orlin, J.B.3
-
2
-
-
38249035911
-
Linear-time computation of optimal subgraph of decomposable graphs
-
0618.68058 10.1016/0196-6774(87)90039-3 890873
-
MW Bern EL Lawler AL Wong 1987 Linear-time computation of optimal subgraph of decomposable graphs J Algorithms 8 216 235 0618.68058 10.1016/0196-6774(87)90039-3 890873
-
(1987)
J Algorithms
, vol.8
, pp. 216-235
-
-
Bern, M.W.1
Lawler, E.L.2
Wong, A.L.3
-
3
-
-
0003096755
-
The quickest flow problem
-
0780.90031 10.1007/BF01415527 1213677
-
R Burkard K Dlaska B Klinz 1993 The quickest flow problem Math Methods Oper Res 37 1 31 58 0780.90031 10.1007/BF01415527 1213677
-
(1993)
Math Methods Oper Res
, vol.37
, Issue.1
, pp. 31-58
-
-
Burkard, R.1
Dlaska, K.2
Klinz, B.3
-
4
-
-
0024884781
-
Analysis of preflow push algorithms for maximum network flow
-
J Cheriyan SN Maheshwari 1989 Analysis of preflow push algorithm for maximum network flow SIAM J Comput 18 1057 1086 0692.68028 10.1137/0218072 1025462 (Pubitemid 20613568)
-
(1989)
SIAM Journal on Computing
, vol.18
, Issue.6
, pp. 1057-1086
-
-
Cheriyan, J.1
Maheshwari, S.N.2
-
7
-
-
0024755290
-
Finding minimum-cost circulations by canceling negative cycles
-
DOI 10.1145/76359.76368
-
AV Goldberg RE Tarjan 1989 Finding minimum-cost circulations by cancelling negative cycles J ACM 36 873 886 0697.68063 10.1145/76359.76368 1072250 (Pubitemid 20613335)
-
(1989)
Journal of the ACM
, vol.36
, Issue.4
, pp. 873-886
-
-
Goldberg Andrew, V.1
Tarjan Robert, E.2
-
9
-
-
0002499479
-
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
-
0724.90022 10.1007/BF02283688 1084424
-
GM Guisewite PM Pardalos 1990 Minimum concave-cost network flow problems: applications, complexity, and algorithms Ann Oper Res 25 75 100 0724.90022 10.1007/BF02283688 1084424
-
(1990)
Ann Oper Res
, vol.25
, pp. 75-100
-
-
Guisewite, G.M.1
Pardalos, P.M.2
-
10
-
-
0021483718
-
Optimal dynamic routing in communication networks with continuous traffic
-
0546.90097 10.1002/net.3230140308 757856
-
B Hajek RG Ogier 1984 Optimal dynamic routing in communication networks with continuous traffic Networks 14 457 487 0546.90097 10.1002/net.3230140308 757856
-
(1984)
Networks
, vol.14
, pp. 457-487
-
-
Hajek, B.1
Ogier, R.G.2
-
13
-
-
0034178966
-
Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
-
0963.90011 10.1002/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0. CO;2-E 1764880
-
D Kim PM Pardalos 2000 Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems Networks 35 3 216 222 0963.90011 10.1002/(SICI)1097-0037(200005)35:3<216::AID- NET5>3.0.CO;2-E 1764880
-
(2000)
Networks
, vol.35
, Issue.3
, pp. 216-222
-
-
Kim, D.1
Pardalos, P.M.2
-
15
-
-
43049137490
-
Flow improvement and network flows with, fixed costs
-
Zürich
-
Krumke S, Noltemeier H, Schwarz S, Wirth H, Ravi R (1998) Flow improvement and network flows with, fixed costs. In: Proceedings of the international conference of operations research (0R'98), Zürich, pp 158-167
-
(1998)
Proceedings of the International Conference of Operations Research (0R'98)
, pp. 158-167
-
-
Krumke, S.1
Noltemeier, H.2
Schwarz, S.3
Wirth, H.4
Ravi, R.5
-
16
-
-
0001716715
-
Combinatorial optimization with rational objective functions
-
0425.90076 10.1287/moor.4.4.414 549127
-
N Megiddo 1979 Combinatorial optimization with rational objective functions Math Oper Res 4 414 424 0425.90076 10.1287/moor.4.4.414 549127
-
(1979)
Math Oper Res
, vol.4
, pp. 414-424
-
-
Megiddo, N.1
-
17
-
-
33750378192
-
Flows in dynamic networks with aggregate arc capacities
-
DOI 10.1016/j.ipl.2006.07.007, PII S0020019006002237
-
V Melkonian 2007 Flows in dynamic networks with aggregate arc capacities Inf Process Lett 101 1 30 35 05664728 10.1016/j.ipl.2006.07.007 2273225 (Pubitemid 44635487)
-
(2007)
Information Processing Letters
, vol.101
, Issue.1
, pp. 30-35
-
-
Melkonian, V.1
-
18
-
-
0020834113
-
Maximum-throughput dynamic network flows
-
0516.90027 10.1007/BF02591946 718060
-
JB Orlin 1983 Maximum-throughput dynamic network flows Math Program 27 214 231 0516.90027 10.1007/BF02591946 718060
-
(1983)
Math Program
, vol.27
, pp. 214-231
-
-
Orlin, J.B.1
-
19
-
-
9144243817
-
Alternative methods to increase the effectiveness of freeway contraflow evacuation
-
10.3141/1865-08
-
G Theodoulou B Wolshon 2004 Alternative methods to increase the effectiveness of freeway contraflow evacuation J Transp Res Board 1865 48 56 10.3141/1865-08
-
(2004)
J Transp Res Board
, vol.1865
, pp. 48-56
-
-
Theodoulou, G.1
Wolshon, B.2
-
20
-
-
33846873907
-
Tabu-based heuristic approach for optimization of network evacuation contraflow
-
10.3141/1964-17
-
H Tuydes A Ziliaskopoulos 2006 Tabu-based heuristic approach for optimization of network evacuation contraflow Transp Res Record 1964 157 168 10.3141/1964-17
-
(2006)
Transp Res Record
, vol.1964
, pp. 157-168
-
-
Tuydes, H.1
Ziliaskopoulos, A.2
-
21
-
-
33847207471
-
Simulation and analysis of freeway lane reversal for coastal hurricane evacuation
-
10.1061/(ASCE)0733-9488(2007)133:1(61)
-
B Williams A Tagliaferri S Meinhold J Hummer N Rouphail 2007 Simulation and analysis of freeway lane reversal for coastal hurricane evacuation J Urban Plng Devel 133 1 61 72 10.1061/(ASCE)0733-9488(2007)133:1(61)
-
(2007)
J Urban Plng Devel
, vol.133
, Issue.1
, pp. 61-72
-
-
Williams, B.1
Tagliaferri, A.2
Meinhold, S.3
Hummer, J.4
Rouphail, N.5
|