臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：A Critical Survey on the Network Optimization Algorithms for Evacuation Planning Problems
書刊名：International Journal of Operations Research
作者：Dhamala, Tanka Nath／Pyakurel, Urmila／Dempe, Stephan
出版日期：2018
卷期：15:3
頁次：頁101-133
主題關鍵詞：Network optimization；Dynamic flows；Transportation problems；Evacuation planning；Algorithms；Complexity
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(3) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:3
  • 共同引用共同引用:3
  • 點閱點閱:140
期刊論文
1.Pascoal, M. M. B.、Captivo, M. E. V.、Climaco, J. C. N.(2006)。A comprehensive survey on the quickest path problem。Annals of Operations Research，147(1)，5-21。  new window
2.Chalmet, L. G.、Francis, R. L.、Saunders, P. B.(1982)。Network Models for Building Evacuation。Management Science，28，86-105。  new window
3.Daganzo, C. F.(1994)。The Cell Transmission Model: A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory。Transportation Research Part B: Methodological，28(4)，269-287。  new window
4.Xie, C.、Lin, D. Y.、Waller, S. Travis(2010)。A Dynamic Evacuation Network Optimization Problem with Lane Reversal and Crossing Elimination Strategies。Transportation Research Part E: Logistics and Transportation Review，46(3)，295-316。  new window
5.Cova, T. J.、Johnson, J. P.(2003)。A network flow model for lane-based evacuation routing。Transportation Research Part A: Policy and Practice，37，579-604。  new window
6.Kisko, T. M.、Francis, R. L.(1985)。EVACNET+: A Computer Program to Determine Optimal Building Evacuation Plans。Fire Safety Journal，9，211-220。  new window
7.Colson, B.、Marcotte, P.、Savard, G.(2007)。An overview of bilevel optimization。Annals of Operations Research，153(1)，235-256。  new window
8.Chen, Y. L.、Chin, Y. H.(1990)。The quickest path problem。Computers & Operations Research，17(2)，153-161。  new window
9.Chen, G. H.、Hung, Y. C.(1993)。On the quickest path problem。Information Processing Letters，46(3)，125-128。  new window
10.Merchant, D. K.、Nemhauser, G. L.(1978)。A Model and an Algorithm for the Dynamic Traffic Assignment Problems。Transportation Science，12(3)，183-199。  new window
11.Ford, L. R.、Fulkerson, D. R.(1958)。Constructing maximal dynamic flows from static flows。Operations Research，6，419-433。  new window
12.Altay, N.、Green, W. G. III(2006)。OR/MS research in disaster operations management。European Journal of Operational Research，175(1)，475-493。  new window
13.Carey, Malachy(1987)。Optimal Time-varying Flows on Congested Networks。Operations Research，35(1)，58-69。  new window
14.Papageorgiou, M.(1990)。Dynamic Modeling, Assignment, and Route Guidance in Traffic Networks。Transportation Research B，24(6)，471-495。  new window
15.Megiddo, N.(1979)。Combinatorial optimization with rational objective functions。Mathematics of Operations Research，4(4)，414-424。  new window
16.Burkard, R. E.、Dlaska, K.、Klinz, B.(1993)。The quickest flow problem。Zeitschrift Für Operations Research: Methods and Models of Operations Research，37(1)，31-58。  new window
17.Chen, L.、Miller-Hooks, E.(2008)。The building evacuation problem with shared information。Naval Research Logistics，55，363-376。  new window
18.Dhamala, T. N.(2015)。A survey on models and algorithms for discrete evacuation planning network problems。Journal of Industrial and Management Optimization，11(1)，265-289。  new window
19.Dhamala, Tanka Nath、Pyakurel, Urmila(20130300)。Earliest Arrival Contraflow Problem on Series-Parallel Graphs。International Journal of Operations Research，10(1)，1-13。  new window
20.Gale, D.(1959)。Transient flows in networks。Michigan Mathematical Journal，6(1)，59-63。  new window
21.Hoppe, B.、Tardos, E.(2000)。The quickest transshipment problem。Mathematics of Operations Research，25，36-62。  new window
22.Hua, J.、Ren, G.、Cheng, Y.、Ran, B.(2014)。An Integrated Contraflow Strategy for Multimodal Evacuation。Mathematical Problems in Engineering，2014，(159473)1-(159473)10。  new window
23.Kim, S.、Shekhar, S.、Min, M.(2008)。Contraflow transportation network reconfiguration for evacuation route planning。IEEE Transactions on Knowledge & Data Engineering，20，1-15。  new window
24.Minieka, E.(1973)。Maximal, lexicographic, and dynamic network flows。Operations Research，21，517-527。  new window
25.Pyakurel, U.、Hamacher, H. W.、Dhamala, T. N.(2014)。Generalized maximum dynamic contraflow on lossy network。International Journal of Operations Research Nepal，3，27-44。  new window
26.Wilkinson, W. L.(1971)。An algorithm for universal maximal dynamic flows in a network。Operations Research，19(7)，1602-1612。  new window
27.Pyakurel, U.、Dhamala, T. N.(2014)。Earliest arrival contraflow model for evacuation planning。Neural, Parallel, and Scientific Computations，22(3)，441-450。  new window
28.Rebennack, S.、Arulselvan, A.、Elefteriadou, L.、Pardalos, P. M.(2010)。Complexity analysis for maximum flow problems with arc reversals。Journal of Combinatorial Optimiation，19，200-216。  new window
29.Ruzika, S.、Sperber, H.、Steiner, M.(2011)。Earliest arrival flows on series-parallel graphs。Networks，10，169-173。  new window
30.Fleischer, L. K.、Tardos, E.(1998)。Efficient continuous-time dynamic network flow algorithms。Operations Research Letters，23(3-5)，71-80。  new window
31.Schmidt, M.、Skutella, M.(2010)。Earliest arrival flows in networks with multiple sinks。Electronics Notes in Discrete Mathematics，36，607-614。  new window
32.Li, C. L.、McCormick, S. T.、Simchi-Levi, D.(1992)。Finding disjoint paths with different path costs: complexity and algorithms。Networks，22(7)，653-667。  new window
33.Litman, T.(2006)。Lessons from Katrina and Rita: What major disasters can teach transportation planners。Journal of Transportation Engineering，132(1)，11-18。  new window
34.Xie, Chi、Turnquist, Mark A.(2011)。Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach。Transportation Research Part C: Emerging Technologies，19(1)，40-63。  new window
35.Jin, S.、Jeong, S.、Kim, J.、Kim, K.(2015)。A logistics model for the transport of disaster victims with various injuries and survival probabilities。Annals of Operations Research，230(1)，17-33。  new window
36.Ng, M. W.、Park, J.、Waller, S. T.(2010)。A hybrid bilevel model for the optimal shelter assignment in emergency evacuations。Computer-Aided Civil and Infrastructure Engineering，25(8)，547-556。  new window
37.Pyakurel, Urmila、Dhamala, Tanka Nath(20150600)。Models and Algorithms on Contraflow Evacuation Planning Network Problems。International Journal of Operations Research，12(2)，36-46。new window  new window
38.Pyakurel, U.、Dhamala, T. N.(2016)。Continuous time dynamic contraflow models and algorithms。Advances in Operations Research，2016，(7902460)1-(7902460)7。  new window
39.Pyakurel, U.、Dhamala, T. N.(2017)。Continuous dynamic contraflow approach for evacuation planning。Annals of Operations Research，253(1)，573-598。  new window
40.Pyakurel, U.、Dhamala, T. N.(2017)。Evacuation planning by earliest arrival contraflow。Journal of Industrial & Management Optimization，13(1)，487-503。  new window
41.Pyakurel, U.、Nath, H. N.、Dhamala, T. N.(2018)。Efficient contraflow algorithms for quickest evacuation planning。Science China Mathematics，61(11)，2079-2100。  new window
42.Saho, M.、Shigeno, M.(2017)。Cancel-and-tighten algorithm for quickest flow problems。Networks，69(2)，179-188。  new window
43.Wang, J. W.、Wang, H. F.、Zhang, W. J.、Ip, W. H.、Furuta, K.(2013)。Evacuation planning based on the contraflow technique with consideration of evacuation priorities and traffic setup time。IEEE Transactions on Intelligent Transportation Systems，14(1)，480-485。  new window
44.Zhao, X.、Feng, Z.-Y.、Li, Y.、Bernard, A.(2016)。Evacuation network optimization model with lane-based reversal and routing。Mathematical Problems in Engineering，2016，(1273508)1-(1273508)12。  new window
45.Anderson, E. J.、Nash, P.、Philpott, A. B.(1982)。A Class of Continuous Network Flow Problems。Mathematics of Operations Research，7，501-514。  new window
46.Koch, R.、Nasrabadi, E.、Skutella, M.(2011)。Continuous and Discrete Flows over Time: a General Model Based on Measure Theory。Mathematical Methods of Operations Research，73，301-337。  new window
47.Philpott, A. B.(1990)。Continuous-time Flows in Networks。Mathematics of Operations Research，15(4)，640-661。  new window
48.Aronson, J. E.(1989)。A Survey of Dynamic Network Flows。Annals of Operations Research，20，1-66。  new window
49.Bish, D. R.(2011)。Planning for a Bus-based Evacuation。OR Spectrum，33(3)，629-654。  new window
50.Goerigk, M.、Grün, B.(2014)。A Robust Bus Evacuation Model with Delayed Scenario Information。OR Spectrum，36(4)，923-948。  new window
51.Goerigk, M.、Grün, B.、Heßler, P.(2013)。Branch and Bound Algorithms for the Bus Evacuation Problem。Computers and Operations Research，40(12)，3010-3020。  new window
52.Hamacher, H. W.、Heller, S.、Rupp, B.(2013)。Flow Location (FlowLoc) Problems: Dynamic Network Flows and location Models for Evacuation planning。Annals of Operations Research，207，161-180。  new window
53.Lim, G. J.、Baharnemati, M. R.、Kim, S. J.(2016)。An Optimization Approach for Real Time Evacuation Reroute Planning。Annals of Operations Research，238，375-388。  new window
54.Akbari, F. V.、Salman, S.(2017)。Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity。European Journal of Operational Research，257，625-640。  new window
55.Akter, S.、Wamba, S. F.(2019)。Big data and disaster management: a systematic review and agenda for future research。Annals of Operation Research，283，939-959。  new window
56.Anaya-Arenas, A. M.、Renaud, J.、Ruiz, A.(2014)。Relief distribution networks: a systematic review。Annals of Operation Research，223，53-79。  new window
57.Anderson, E. J.(1989)。Extreme-points for continuous network problems with arc delays。Journal Information and Optimization sciences，10，45-52。  new window
58.Anderson, E. J.、Nash, P.、Perold, A. F.(1983)。Some properties of a class of continuous linear programs。SIAM Journal Control and Optimization，21(5)，758-765。  new window
59.Baumann, N.、Köhler, E.(2007)。Approximating earliest arrival flows with flow-dependent transit times。Discrete Applied Mathematics，155，161-171。  new window
60.Pyakurel, U.、Dhamala, T. N.、Dempe, S.(2017)。Efficient Continuous Contraflow Algorithms for Evacuation Planning Problems。Annals of Operations Research，254(1/2)，335-364。  new window
61.Baumann, N.、Skutella, M.(2009)。Earliest arrival flows with multiple sources。Mathematics of Operations Research，34，499-512。  new window
62.Berlin, G. N.(1978)。The Use of Directed Routes for Assigning Escape Potential。Fire Technology，14(2)，126-135。  new window
63.Cai, X.、Sha, D.、Wong, C. K.(2001)。Time-varying minimum cost flow problems。European Journal of Operations Research，131，352-374。  new window
64.Carey, M.(1992)。Nonconvexity of dynamic traffic assignment problem。Transportation Research B，26(2)，127-133。  new window
65.Carey, M.、Subrahmanian, E.(2000)。An approach to modeling time-varying flows on congested networks。Transportation Research Part B，34，157-183。  new window
66.Chalmet, L. G.、Francis, R. L.、Saunders, P. B.(1982)。Network models for building evacuation。Fire Technology，18，90-113。  new window
67.Chen, H. K.、Hsueh, C. F.(1998)。A model and an algorithm for the user-optimal route choice problem。Transportation research B，32(3)，219-234。  new window
68.Dhamala, Tanka Nath、Adhikari, Iswar Mani(20180300)。On Evacuation Planning Optimization Problems from Transit-based Perspective。International Journal of Operations Research，15(1)，29-47。new window  new window
69.Dhungana, R. C.、Pyakurel, U.、Dhamala, T. N.(2018)。Abstract Contraflow Models and Solution Procedures for Evacuation Planning。Journal of Mathematics Research，10(4)，89-100。  new window
70.Duhamel, C.、Santos, A. C.、Brasil, D.、Châtelet, E.、Birregah, B.(2016)。Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations。Annals of Operation Research，247，693-713。  new window
71.Ferrari, P.(1990)。Capacity constraints in urban transport networks。Transportation Res E，31(4)，291-301。  new window
72.Farahani, M. M.、Chaharsooghi, S. K.、Woensel, T. V.、Veelenturf, L. P.(2018)。Capacitated network-flow approach to the evacuation-location problem。Computers and Industrial Engineering，115，407-427。  new window
73.Fleischer, L. K.(2001)。Faster algorithms for quickest transshipment problem。SIAM Journal on Optimization，12，18-35。  new window
74.Fleischer, L.、Skutella, M.(2007)。Quickest flows over time。SIAM Journal of Computing，36，1600-1630。  new window
75.Fleischer, L. K.、Wayne, K. D.(2002)。Fast and simple approximation schemes for generalized flow。Mathematical programming，91，215-238。  new window
76.Gallo, G. M.、Grigoriadis, M. D.、Tarjan, R. E.(1989)。A fast parametric maximum flow algorithm and applications。SIAM Journal of Computing，18，30-55。  new window
77.Goldberg, A. V.、Plotkin, S. A.、Tardos, E.(1991)。Combinatorial algorithms for the generalized circulation problems。Mathematics of Operations Research，16，351-381。  new window
78.Goldberg, A. V.、Tarjan, R. E.(1990)。Finding minimum-cost circulations by successive approximation。Mathematics of Operations Research，15(3)，430-466。  new window
79.Gutjahr, W. J.、Nolz, P. C.(2016)。Multicriteria optimization in humanitarian aid。European Journal of Operational Research，252，351-366。  new window
80.Hajek, B.、Ogier, R. G.(1984)。Optimal dynamic routing in communication networks with continuous traffic。Networks，14，457-487。  new window
81.Hall, A.、Hippler, S.、Skutella, M.(2007)。Multicommodity flows over time: Efficient algorithms and complexity。Theoretical Computer Science，379，387-404。  new window
82.Hall, A.、Langkau, K.、Skutella, M.(2007)。An FPTAS for quickest multicommodity flows with inflow-dependent transit times。Algorithmica，47，299-321。  new window
83.Halpern, J.(1979)。A generalized dynamic flows problem。Networks，39，133-167。  new window
84.Hamacher, H. W.、Ruzika, S.、Tjandra, S. A.(2006)。Algorithms for time-dependent bicriteria shortest path problems。Discrete Optimization，3，238-254。  new window
85.Hamacher, H. W.、Tufecki, S.(1987)。On the use of lexicographic min-cost flows in evacuation modeling。Naval Research Logistics，34，487-503。  new window
86.Hanawa, Y.、Higashikawa, Y.、Kamiyama, N.、Katoh, N.、Takizawa, A.(2017)。The mixed evacuation problem。Journal of Combinatorial Optimization，36(4)，1299-1314。  new window
87.Harker, P. T.、Pang, J. S.(1990)。Finite-dimensional variational inequality and nonlinear complementary problems: A survey of theory algorithms and applications。Mathematical Programming，48，161-220。  new window
88.Hoffman, A.(1974)。A generalization of max flow-min cut。Mathematical Programming，6(1)，352-359。  new window
89.Janson, B. N.(1991)。Dynamic traffic assignment for urban road network。Transportation Research B: Methodological，25，143-161。  new window
90.Jarvis, J.、Ratliff, H.(1982)。Some equivalent objectives for dynamic network flow problems。Management Science，28，106-108。  new window
91.Jayakrishnan, R.、Tsai, W. K.、Chen, A.(1995)。A dynamic traffic assignment model with traffic-flow relationship。Transportation Research C，3(1)，51-72。  new window
92.Kalinowski, T.、Matsypura, D.、Savelsbergh, M. W.(2015)。Incremental network design with maximum flows。European Journal of Operational Research，242，51-62。  new window
93.Kappmeier, J.-P. W.、Matuschke, J.、Peis, B.(2014)。Abstract flows over time: A first step towards solving dynamic packing problems。Theoretical Computer Sciences，544，74-83。  new window
94.Karger, D. R.、Stein, C.(1996)。A new approach to the minimum cut problem。Journal of the ACM，43(4)，601-640。  new window
95.Kaufman, D. E.、Nonis, J.、Smith, R. L.(1998)。A mixed integer linear programming model for dynamic route guidance。Transportation Research B，32(6)，431-440。  new window
96.Khadka, Shree Ram、Bhandari, Phanindra Prasad(20170400)。Dynamic Network Contraflow Evacuation Planning Problem with Continuous Time Approach。International Journal of Operations Research，14(1)，27-34。  new window
97.Khalilpourazari, S.、Khamseh, A. A.(2019)。Bi-objective emergency blood supply chain network design in earthquake considering earthquake magnitude: a comprehensive study with real world application。Annals of Operation Research，283，355-393。  new window
98.Kim, J. S.、Lee, D. H.(2015)。An integrated approach for collection network design, capacity planning and vehicle routing in reverse logistics。Journal of the Operational Research Society，66(1)，76-85。  new window
99.Klinz, B.、Woeginger, G. J.(2004)。Minimum cost dynamic flows: the series-parallel case。Networks，43，153-162。  new window
100.Kostreva, M. M.、Wiecek, M. M.(1993)。Time dependency in multiple objective dynamic programming。Journal of mathematical analysis and application，173(1)，289-307。  new window
101.Köhler, E.、Skutella, M.(2005)。Flows over time with load-dependent transit times。SIAM Journal of Optimization，15(4)，1185-1202。  new window
102.Krumke, S. O.、Zeck, C.(2013)。Generalized max flow in series-parallel graphs。Discrete Optimization，10，155-162。  new window
103.Li, X.、Zhao, Z.、Zhu, X.、Wyatt, T.(2011)。Covering models and optimization techniques for emergency response facility location and planning: a review。Mathematical Methods of Operations Research，74(3)，281-310。  new window
104.Lv, N.、Yan, X.、Xu, K.、Wu, C.(2010)。Bi-level programming based contraflow optimization for evacuation events。Kybernetes，39(8)，1227-1234。  new window
105.Megiddo, N.(1974)。Optimal flows in networks with multiple sources and sinks。Mathematical Programming，7(1)，97-107。  new window
106.Miller-Hooks, E.、Patterson, S. S.(2004)。On solving quickest time problems in time-dependent dynamic flows。Journal of Mathematical Modelling and Algorithms，3，39-71。  new window
107.Onaga, K.(1966)。Dynamic programming of optimum flows in lossy communication nets。IEEE Transactions on Circuit Theory，13，282-287。  new window
108.Onaga, K.(1967)。Optimal flows in general communication networks。Journal of the Franklin Institute，283，308-327。  new window
109.Yang, F.、Yuan, Q.、Du, S.、Liang, L.(2016)。Reserving relief supplies for earthquake: a multi-attribute decision making of China Red Cross。Annals of Operation Research，247，759-785。  new window
110.Xiang, Y.、Zhuang, J.(2016)。A medical resource allocation model for serving emergency victims with deteriorating health conditions。Annals of Operations Research，236，177-196。  new window
111.Wang, J. W.、Ip, W. H.、Zhang, W. J.(2010)。An integrated road construction and resource planning approach to the evacuation of victims from single source to multiple destinations。IEEE Transactions on Intelligent Transportation Systems，11(2)，277-289。  new window
112.Vogiatzis, C.、Yoshida, R.、Aviles-Spadoni, I.、Imamoto, S.、Pardalos, P. M.(2013)。Livestock evacuation planning for natural and man-made emergencies。International Journal of Mass Emergencies and Disasters，31(1)，25-37。  new window
113.Végh, L. A.(2018)。A Strongly Polynomial Algorithm for Generalized Flow Maximization。Mathematics of Operations Research，42(1)，179-211。  new window
114.Torre, D. L.(2017)。Multiple criteria optimization and goal programming in science, engineering, and social sciences。Annals of Operations Research，251，1-5。  new window
115.Smith, J. M. G.、Cruz, E. R. B.(2014)。M/G/c/c state dependent travel time models and properties。Physica A，395，560-579。  new window
116.Stefanello, F.、Buriol, L. S.、Hirsch, M. J.、Pardalos, P. M.、Querido, T.、Resende, M. G. C.、Ritt, M.(2017)。On the minimization of traffic congestion in road networks with tolls。Annals of Operation Research，249，119-139。  new window
117.Saadatseresht, M.、Mansourian, A.、Taleai, M.(2009)。Evacuation planning using multiobjective evolutionary optimization approach。European Journal of Operational Research，198，305-314。  new window
118.Rosen, J. B.、Sun, S. Z.、Xue, G. L.(1991)。Algorithms for the quickest path problems and the enumeration of quickest paths。Computers and Operations Research，18，579-584。  new window
119.Pyakurel, U.、Goerigk, M.、Dhamala, T. N.、Hamacher, H. W.(2016)。Transit dependent evacuation planning for Kathmandu valley: A case study。International Journal of Operations Research Nepal，5，49-73。  new window
120.Pullan, M. C.(1997)。A study of general dynamic network problems with arc time-delays。SIAM Journal Optimization，7(4)，889-912。  new window
121.Philpott, A. B.、Mees, A. I.(1992)。Continuous-time shortest path problems with stopping and starting costs。Applied mathematics Letters，5，63-66。  new window
122.Philpott, A. B.、Mees, A. I.(1993)。Finite-time algorithm for shortest path problems with time-varying costs。Applied mathematics Letters，6(2)，91-94。  new window
123.Philpott, A. B.、Craddock, M.(1995)。An adaptive discretization algorithm for a class of continuous network programs。Networks，26，1-11。  new window
124.Peeta, S.、Ziliaskopoulos, A.(2001)。Foundations of dynamic traffic assignment: Past, present and the future。Networks and Spatial Economics，1，233-265。  new window
125.Orlin, J. B.(1984)。Minimum convex cost dynamic network flows。Mathematics of Operations Research，9，190-207。  new window
126.Ford, L. R. Jr.、Fulkerson, D. R.(1956)。Maximal flow through a network。Canadian Journal of Mathematics，8(3)，399-404。  new window
127.Anderson, E. J.、Philpott, A. B.(1989)。A Continuous-time Network Simplex Algorithm。Networks，19(4)，395-425。  new window
128.Pullan, M. C.(1993)。An Algorithm for a Class of Continuous Linear Programs。SIAM Journal on Control and Optimization，31(6)，1558-1577。  new window
會議論文
1.Baumann, N.、Skutella, M.(2006)。Solving evacuation problems efficiently, earliest arrival flows with multiple sources。Foundations of Computer Science, 47th Annual IEEE Symposium，399-410。  new window
2.Moriarty, K. D.、Ni, D.、Collura, J.(2007)。Modeling traffic flow under emergency evacuation situations: current practice and future directions。86th Transportation Research Board Annual Meeting。Washington, DC。  new window
3.Kim, S.、Shekhar, S.(2005)。Contraflow network reconfiguration for evacuation planning: a summary of results。13th ACM Symposium on Advances in Geographic Information Systems，250-259。  new window
4.Yusoff, M.、Ariffin, J.、Mohamed, A.(2008)。Optimization approaches for macroscopic emergency evacuation planning: a survey。International symposium on information technology。IEEE。  new window
5.Groß, M.、Kappmeier, J.-P. W.、Schmidt, D. R.、Schmidt, M.(2012)。Approximating Earliest Arrival Flows in Arbitrary Networks。20th Annual European Symposium，551-562。  new window
6.Hoppe, B.、Tardos, E.(1994)。Polynomial time algorithms for some evacuation problems。Fifth Annual ACM-SIAM Symposium on Discrete Algorithms，433-441。  new window
7.Fleischer, L. K.、Skutella, M.(2002)。The Quickest multicommodity flow problem。Integer programming and combinatorial optimization: The 9th international conference。Berlin：Springer。36-53。  new window
8.Groß, M.、Skutella, M.(2012)。Generalized maximum flows over time。The 9th Workshop on Approximation and Online Algorithms，247-260。  new window
9.Hall, A.、Langkau, K.、Skutella, M.(2003)。An FPTAS for quickest multicommodity flows with inflow-dependent transit times。APPROX'03。Springer。71-82。  new window
10.Hamza-Lup, G.、Hua, K. A.、Le, M.、Peng, R.(2004)。Enhancing intelligent transportation systems to improve and support homeland security。The Seventh IEEE International Conference, Intelligent Transportation Systems，250-255。  new window
11.Klinz, B.、Woeginger, G. J.(1995)。Minimum cost dynamic flows, the series-parallel case。The 4th Conference on Integer Programming and Combinatorial Optimization，329-343。  new window
12.Köhler, E.、Langkau, K.、Skutella, M.(2002)。Time expanded graphs for flow depended transit times。ESA 2002。Springer-Verlag。599-611。  new window
13.Lin, M.、Jaillet, P.(2015)。On the quickest flow problem in dynamic networks: a parametric min-cost flow approach。The Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms，1343-1356。  new window
14.Martens, M.、McCormick, S. T.(2008)。A polynomial algorithm for weighted abstract flow。The 13th Conference on Integer Programming and Combinatorial Optimization。Springer。97-111。  new window
15.McCormick, S. T.(1996)。A polynomial algorithm for abstract maximum flow。The 7th Annual ACM-SIAM Symposium on Discrete Algorithms，490-497。  new window
16.Vogiatzis, C.、Walteros, J. L.、Pardalos, P. M.(2012)。Evacuation through clustering techniques。The first International Conference on Network Analysis。Springer。185-198。  new window
17.Vaidya, P. M.(1989)。A new algorithm for minimizing convex functions over convex sets。30th Ann. IEEE Symposium on Foundations of Computer Science。  new window
18.Orlin, J. B.(1988)。A faster strongly polynomial minimum cost flow algorithm。20th Annual Symp. Theory of Computing，377-387。  new window
19.Orlin, J. B.(2013)。Max flow in O((nm) time, or better。The 45th ACM Symposium on the Theory of Computing，765-774。  new window
研究報告
1.Schroeder, J.、Guedes, A.、Duarte, E. P.(2004)。Computing the minimum cut and maximum flow of undirected graphs。  new window
學位論文
1.Hoppe, B. E.(1995)。Efficient dynamic network flow algorithms(博士論文)。Cornell University。  new window
2.Arulselvan, A.(2009)。Network Model for Disaster Management(博士論文)。University of Florida。  new window
3.Baumann, N.(2007)。Evacuation by earliest arrival flows(博士論文)。University of Dortmund。  new window
4.Pyakurel, U.(2016)。Evacuation Planning Problem with Contraflow Approach(博士論文)。Tribhuvan Univeristy。  new window
5.Groß, M.(2014)。Approximation algorithms for complex network flow over time problems(博士論文)。Technical University，Berlin。  new window
6.Kappmeier, J.-P. W.(2015)。Generalizations of flows over time with application in evacuation optimization(博士論文)。Technical University，Berlin。  new window
7.Matuschke, J.(2014)。Network flows and network design in theory and practice(博士論文)。Technical University，Berlin。  new window
8.Tjandra, S. A.(2003)。Dynamic network optimization with applications to evacuation planning(博士論文)。University of Kaiserslautern。  new window
圖書
1.Ford, L. R.、Fulkerson, D. R.(1962)。Flows in Networks。Princeton, New Jersey：Princeton University Press。  new window
2.Bozhenyuk, A. V.、Gerasimenko, E. M.、Kacprzyk, J.、Rozenberg, I. N.(2017)。Flows in Networks Under Fuzzy Conditions。Springer。  new window
3.Bretschneider, S.(2013)。Mathematical Models for Evacuation Planning in Urban Areas。Springer。  new window
4.Gondran, M.、Minoux, M.(1984)。Graphs and Algorithms。Wiley。  new window
5.Grötschel, M.、Lovász, L.、Schrijver, A.(1988)。Geometric algorithms and combinatorial optimization。Springer。  new window
6.Kotsireas, I. S.、Nagurney, A.、Pardalos, P. M.(2015)。Dynamics of disasters-key concepts, models, algorithms, and insights。  new window
7.Kruhl, J. H.、Adhikari, R.、Dorka, U. E.(2018)。Living Under the Threat of Earthquakes: Short and Long-term Management of Earthquake Risks and Damage Prevention in Nepal。Springer Natural Hazards。  new window
8.Ran, B.、Boyse, D.(1996)。Modeling dynamic transportation network。Springer Heidelberg。  new window
圖書論文
1.Hamacher, H. W.、Tjandra, S. A.(2002)。Mathematical modeling of evacuation problems: a state of the art。Pedestrian and Evacuation Dynamics。Springer。  new window
2.Anderson, E. J.、Philpott, A. B.(1994)。Optimization of flows in networks over time。Probability, Statistics and Optimization。Wiley and Sons。  new window
3.Dhamala, T. N.、Adhikari, I. M.、Nath, H. M.、Pyakurel, U.(2018)。Meaningfulness of OR models and solution strategies in emergency planning。Living Under the Threat of Earthquakes: Short and Long-term Management of Earthquake Risks and Damage Prevention in Nepal。Springer Natural Hazards。  new window
4.Powell, W. B.、Jaillet, P.、Odoni, A.(1995)。Stochastic and dynamic networks and routing。Network Routing。Amsterdam：North-Holland。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
無相關博士論文
 
無相關書籍
 
無相關著作
 
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：403（臺灣：403，外國：0） ／ 本年度總使用人次：1641614 ／ 訪客人次（自102年09月）：67441014
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上