-
1
-
-
0001424107
-
Constructing maximal dynamic flows from static flows
-
May-June
-
L. R. Ford and D. R. Fulkerson, "Constructing maximal dynamic flows from static flows," Operations Research, vol. 6, no. 3, pp. 419-433, May-June 1958.
-
(1958)
Operations Research
, vol.6
, Issue.3
, pp. 419-433
-
-
Ford, L.R.1
Fulkerson, D.R.2
-
2
-
-
6444234169
-
An annotated overview of dynamic network flows
-
09
-
B. Kotnyek, "An annotated overview of dynamic network flows," INRIA, Tech. Rep. RR-4936, 09 2003.
-
(2003)
INRIA, Tech. Rep. RR-4936
-
-
Kotnyek, B.1
-
4
-
-
26444598445
-
Capacity Constrained Routing algorithms for evacuation planning: A summary of results
-
Advances in Spatial and Temporal Databases: 9th International Symposium, SSTD 2005. Proceedings
-
Q. Lu, B. George, and S. Shekhar, "Capacity constrained routing algorithms for evacuation planning: A summary of results," in Advances in Spatial and Temporal Databases, ser. Lecture Notes in Computer Science, C. Bauzer Medeiros, M. Egenhofer, and E. Bertino, Eds. Springer Berlin/Heidelberg, 2005, vol. 3633, pp. 291-307. (Pubitemid 41433171)
-
(2005)
Lecture Notes in Computer Science
, vol.3633
, pp. 291-307
-
-
Lu, Q.1
George, B.2
Shekhar, S.3
-
5
-
-
85007217435
-
The quickest transshipment problem
-
ser. SODA '95. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
-
B. Hoppe and E. Tardos, "The quickest transshipment problem," in Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '95. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1995, pp. 512-521.
-
(1995)
Proceedings of the Sixth Annual ACM-siam Symposium on Discrete Algorithms
, pp. 512-521
-
-
Hoppe, B.1
Tardos, E.2
-
6
-
-
0034138344
-
The quickest transshipment problem
-
February [Online]
-
B. Hoppe and O. Tardos, "The quickest transshipment problem," Math. Oper. Res., vol. 25, pp. 36-62, February 2000. [Online]. Available: http://portal.acm.org/citation.cfm?id=351180.351185
-
(2000)
Math. Oper. Res.
, vol.25
, pp. 36-62
-
-
Hoppe, B.1
Tardos, O.2
-
7
-
-
84989675214
-
On the use of lexicographic min cost flows in evacuation modeling
-
August
-
H. W. Hamacher and S. Tufekci, "On the use of lexicographic min cost flows in evacuation modeling," Naval Research Logistics, vol. 34, no. 4, pp. 487-503, August 1987.
-
(1987)
Naval Research Logistics
, vol.34
, Issue.4
, pp. 487-503
-
-
Hamacher, H.W.1
Tufekci, S.2
-
8
-
-
47249138674
-
Emergency evacuation using wireless sensor networks
-
Washington, DC, USA: IEEE Computer Society
-
M. Barnes, H. Leather, and D. K. Arvind, "Emergency evacuation using wireless sensor networks," in Proceedings of the 32nd IEEE Conference on Local Computer Networks. Washington, DC, USA: IEEE Computer Society, 2007, pp. 851-857.
-
(2007)
Proceedings of the 32nd IEEE Conference on Local Computer Networks
, pp. 851-857
-
-
Barnes, M.1
Leather, H.2
Arvind, D.K.3
-
9
-
-
0015330635
-
Theoretical improvements in algorithmic efficiency for network flow problems
-
April [Online] http://doi.acm.org/10.1145/321694.321699
-
J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol. 19, pp. 248-264, April 1972. [Online]. Available: http://doi.acm.org/10.1145/321694.321699
-
(1972)
J. ACM
, vol.19
, pp. 248-264
-
-
Edmonds, J.1
Karp, R.M.2
|