Chen, Qi (George); Lei, Yanzhe (Murray); Jasin, Stefanus Real-time spatial-intertemporal pricing and relocation in a ride-hailing network: near-optimal policies and the value of dynamic pricing. (English) Zbl 07960298 Oper. Res. 72, No. 5, 2097-2118 (2024). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Fujie, Tetsuya; Higashikawa, Yuya; Katoh, Naoki; Teruyama, Junichi; Tokuni, Yuki Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. (English) Zbl 07929169 J. Comb. Optim. 48, No. 2, Paper No. 15, 20 p. (2024). MSC: 90C35 90B80 × Cite Format Result Cite Review PDF Full Text: DOI
Chernykh, Ilya; Kononov, Alexander; Sevastyanov, Sergey An exact solution with an improved running time for the routing flow shop problem with two machines. (English) Zbl 1548.90198 J. Sched. 27, No. 4, 329-340 (2024). MSC: 90B35 90B10 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Haasler, Isabel; Ringh, Axel; Chen, Yongxin; Karlsson, Johan Scalable computation of dynamic flow problems via multimarginal graph-structured optimal transport. (English) Zbl 1542.49037 Math. Oper. Res. 49, No. 2, 986-1011 (2024). MSC: 49Q22 90-08 90C35 90C08 49M29 90B06 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dhamala, Tanka Nath; Adhikari, Mohan Chandra; Khanal, Durga Prasad; Pyakurel, Urmila Generalized maximum flow over time with intermediate storage. (English) Zbl 1543.90061 Ann. Oper. Res. 335, No. 1, 111-134 (2024). MSC: 90B10 90C27 68W25 90B06 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Moothedath, Shana; Sahabandu, Dinuka; Allen, Joey; Bushnell, Linda; Lee, Wenke; Poovendran, Radha Stochastic dynamic information flow tracking game using supervised learning for detecting advanced persistent threats. (English) Zbl 1539.93071 Automatica 159, Article ID 111353, 14 p. (2024). MSC: 93B70 91A10 91A15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nath, Hari Nandan; Dhamala, Tanka Nath; Dempe, Stephan Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach. (English) Zbl 07814726 Opsearch 61, No. 1, 98-120 (2024). MSC: 90Bxx 90B10 90C27 68Q25 90B06 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Sering, Leon; Vargas Koch, Laura; Ziemke, Theresa Convergence of a packet routing model to flows over time. (English) Zbl 1533.05106 Math. Oper. Res. 48, No. 3, 1741-1766 (2023). MSC: 05C21 90B10 91A25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Erusalimskiy, I. M.; Rusakov, V. A. Some networks that allow splashes of dynamic flows and finding the maximum splash value. (English) Zbl 1531.90054 J. Math. Sci., New York 271, No. 2, Series A, 223-232 (2023). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Benkoczi, Robert; Lijoka, Oluwaseun F. Capacity provisioning for evacuation on path networks. (English) Zbl 1529.90012 Networks 81, No. 1, 75-92 (2023). MSC: 90B06 90B80 90B10 68Q25 90C47 × Cite Format Result Cite Review PDF Full Text: DOI
Irannezhad, Ashkan; Primkulov, Bauyrzhan K.; Juanes, Ruben; Zhao, Benzhong Characteristics of fluid-fluid displacement in model mixed-wet porous media: patterns, pressures and scalings. (English) Zbl 1518.76052 J. Fluid Mech. 967, Paper No. A27, 20 p. (2023). MSC: 76S05 76T06 76E17 76D45 76M99 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Wei, Jie; Du, Meng; Wang, Run-na; Duan, Jin-li; Gao, Zhong-ke Symbolic transition network for characterizing the dynamics behaviors of gas-liquid two-phase flow patterns. (English) Zbl 1511.76105 Physica A 611, Article ID 128449, 11 p. (2023). MSC: 76T10 76M99 × Cite Format Result Cite Review PDF Full Text: DOI
Dabaghian, Pedram H.; Ahmed, Shady E.; San, Omer Nonintrusive reduced order modelling of convective Boussinesq flows. (English) Zbl 1508.76089 Int. J. Comput. Fluid Dyn. 36, No. 7, 578-598 (2022). MSC: 76M99 76D99 76R10 80A19 68T05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Li, Yifen; Bei, Xiaohui; Qiao, Youming; Tao, Dacheng; Chen, Zhiya Heterogeneous multi-commodity network flows over time. (English) Zbl 07615741 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 238-255 (2022). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Du, Ding-Zhu; Pardalos, Panos M.; Hu, Xiaodong; Wu, Weili Introduction to combinatorial optimization. (English) Zbl 1512.90001 Springer Optimization and Its Applications 196. Cham: Springer (ISBN 978-3-031-10594-4/hbk; 978-3-031-11684-1/pbk; 978-3-031-10596-8/ebook). xi, 402 p. (2022). Reviewer: Samir Kumar Neogy (New Delhi) MSC: 90-01 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Nath, Hari Nandan; Dempe, Stephan; Dhamala, Tanka Nath A bicriteria approach for saving a path maximizing dynamic contraflow. (English) Zbl 1493.90038 Asia-Pac. J. Oper. Res. 39, No. 3, Article ID 2150027, 24 p. (2022). MSC: 90B10 90C27 90C35 90B06 × Cite Format Result Cite Review PDF Full Text: DOI
Kaiser, Marcus Computation of dynamic equilibria in series-parallel networks. (English) Zbl 1491.90026 Math. Oper. Res. 47, No. 1, 50-71 (2022). MSC: 90B10 90B15 90B22 68Q15 05C21 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Golin, Mordecai; Sandeep, Sai Minmax regret for sink location on dynamic flow paths with general capacities. (English) Zbl 1487.90438 Discrete Appl. Math. 315, 1-26 (2022). MSC: 90B80 90B10 90C35 90C47 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Barth, Dominique; Mautor, Thierry; Watel, Dimitri; Weisser, Marc-Antoine A polynomial algorithm for deciding the validity of an electrical distribution tree. (English) Zbl 1486.90056 Inf. Process. Lett. 176, Article ID 106249, 6 p. (2022). MSC: 90B10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Verhaegen, Michel; Yu, Chengpu; Sinquin, Baptiste Data-driven identification of networks of dynamic systems. (English) Zbl 1501.93002 Cambridge: Cambridge University Press (ISBN 978-1-316-51570-9/hbk; 978-1-00-902633-8/ebook). xviii, 267 p. (2022). Reviewer: Dariusz Uciński (Zielona Góra) MSC: 93-02 93B30 93A15 93B70 93C35 93C05 × Cite Format Result Cite Review PDF Full Text: DOI
Cominetti, Roberto; Correa, José; Olver, Neil Long-term behavior of dynamic equilibria in fluid queuing networks. (English) Zbl 1482.90045 Oper. Res. 70, No. 1, 516-526 (2022). MSC: 90B10 90B22 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
de Lima, Vinícius L.; Alves, Cláudio; Clautiaux, François; Iori, Manuel; Valério de Carvalho, José M. Arc flow formulations based on dynamic programming: theoretical foundations and applications. (English) Zbl 1487.90204 Eur. J. Oper. Res. 296, No. 1, 3-21 (2022). MSC: 90B10 90C27 90B35 90C39 90-02 × Cite Format Result Cite Review PDF Full Text: DOI arXiv HAL
Benkoczi, Robert; Bhattacharya, Binay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki; Teruyama, Junichi Locating evacuation centers optimally in path and cycle networks. (English) Zbl 07896705 Müller-Hannemann, Matthias (ed.) et al., 21st symposium on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS 2021, Lisbon, Portugal (virtual conference), September 9–10, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 96, Article 13, 19 p. (2021). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Higashikawa, Yuya; Katoh, Naoki; Teruyama, Junichi; Watase, Koji Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks. (English) Zbl 1504.90070 Theor. Comput. Sci. 873, 87-113 (2021). MSC: 90B80 68Q25 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ryan, Christopher Thomas; Smith, Robert L. Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. (English) Zbl 1465.90115 Math. Program. 187, No. 1-2 (A), 253-285 (2021). MSC: 90C39 90C05 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Vernet, Mathilde; Drozdowski, Maciej; Pigné, Yoann; Sanlaville, Eric A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. (English) Zbl 1460.90050 Discrete Appl. Math. 296, 203-216 (2021). MSC: 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Barth, Dominique; Mautor, Thierry; de Moissac, Arnaud; Watel, Dimitri; Weisser, Marc-Antoine Optimisation of electrical network configuration: complexity and algorithms for ring topologies. (English) Zbl 1500.90010 Theor. Comput. Sci. 859, 162-173 (2021). MSC: 90B10 68Q25 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Kamiyama, Naoyuki Lexicographically optimal earliest arrival flows. (English) Zbl 07764300 Networks 75, No. 1, 18-33 (2020). MSC: 90-XX 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Chernykh, Ilya; Kononov, Alexander; Sevastyanov, Sergey A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. (English) Zbl 1460.90084 Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 301-312 (2020). MSC: 90B35 90B10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zhao, Ming; Zhang, Minjiao Multiechelon lot sizing: new complexities and inequalities. (English) Zbl 1446.90048 Oper. Res. 68, No. 2, 534-551 (2020). MSC: 90B05 × Cite Format Result Cite Review PDF Full Text: DOI
Nadtochiy, Sergey; Shkolnikov, Mykhaylo Mean field systems on networks, with singular interaction through hitting times. (English) Zbl 1448.82032 Ann. Probab. 48, No. 3, 1520-1556 (2020). Reviewer: Claudia Simionescu-Badea (Wien) MSC: 82C22 05C57 54H25 92C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid
Benkoczi, Robert; Bhattacharya, Binay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki Minsum \(k\)-sink problem on path networks. (English) Zbl 1442.90024 Theor. Comput. Sci. 806, 388-401 (2020). MSC: 90B10 90B80 90C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Yang, Xiawei; Li, Wenya; Xu, Yaxin; Dong, Xiurong; Hu, Kaiwei; Zou, Yangfan Performance of two different constitutive models and microstructural evolution of GH4169 superalloy. (English) Zbl 1501.74059 Math. Biosci. Eng. 16, No. 2, 1034-1055 (2019). MSC: 74M25 74F05 74S05 × Cite Format Result Cite Review PDF Full Text: DOI
Dhungana, Ram Chandra; Dhamala, Tanka Nath Maximum FlowLoc problems with network reconfiguration. (English) Zbl 1480.90041 Int. J. Oper. Res., Taichung 16, No. 1, 13-26 (2019). MSC: 90B06 90B80 × Cite Format Result Cite Review PDF Full Text: Link
Han, Ke; Eve, Gabriel; Friesz, Terry L. Computing dynamic user equilibria on large-scale networks with software implementation. (English) Zbl 1514.90064 Netw. Spat. Econ. 19, No. 3, 869-902 (2019). MSC: 90B20 90B10 91A10 91A80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Shin, Youngchul; Kim, Sungwoo; Moon, Ilkyeong Simultaneous evacuation and entrance planning in complex building based on dynamic network flows. (English) Zbl 1481.90071 Appl. Math. Modelling 73, 545-562 (2019). MSC: 90B06 90B90 × Cite Format Result Cite Review PDF Full Text: DOI
Ren, Weikai; Jin, Ningde Vector visibility graph from multivariate time series: a new method for characterizing nonlinear dynamic behavior in two-phase flow. (English) Zbl 1430.37097 Nonlinear Dyn. 97, No. 4, 2547-2556 (2019). MSC: 37M10 05C82 82C26 × Cite Format Result Cite Review PDF Full Text: DOI
Bayen, Alexandre; Keimer, Alexander; Porter, Emily; Spinola, Michele Time-continuous instantaneous and past memory routing on traffic networks: a mathematical analysis on the basis of the link-delay model. (English) Zbl 1432.34107 SIAM J. Appl. Dyn. Syst. 18, No. 4, 2143-2180 (2019). MSC: 34K60 90B20 92B20 × Cite Format Result Cite Review PDF Full Text: DOI
Schiopu, Camelia Maximum flows in bipartite dynamic networks. (English) Zbl 1438.90054 Bull. Transilv. Univ. Brașov, Ser. III, Math. Inform. Phys. 12(61), No. 1, 177-198 (2019). MSC: 90B10 90C35 05C35 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Kamiyama, Naoyuki Discrete Newton methods for the evacuation problem. (English) Zbl 1433.90029 Theor. Comput. Sci. 795, 510-519 (2019). MSC: 90B06 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Arumugam, Guru Prakash; Augustine, John; Golin, Mordecai J.; Srikanthan, Prashanth Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities. (English) Zbl 1431.90031 Algorithmica 81, No. 9, 3534-3585 (2019). MSC: 90B10 90C35 90C47 × Cite Format Result Cite Review PDF Full Text: DOI
Shiono, Naoshi; Suzuki, Hisatoshi; Saruwatari, Yasufumi A dynamic programming approach for the pipe network layout problem. (English) Zbl 1430.90172 Eur. J. Oper. Res. 277, No. 1, 52-61 (2019). MSC: 90B10 90C35 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Khodayifar, S.; Raayatpanah, M. A.; Pardalos, P. M. A polynomial time algorithm for the minimum flow problem in time-varying networks. (English) Zbl 1411.90067 Ann. Oper. Res. 272, No. 1-2, 29-39 (2019). MSC: 90B10 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Bhattacharya, Binay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks. (English) Zbl 1532.68062 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 14, 13 p. (2018). MSC: 68R10 68W40 90B10 90B80 × Cite Format Result Cite Review PDF Full Text: DOI
Scarsini, Marco; Schröder, Marc; Tomala, Tristan Dynamic atomic congestion games with seasonal flows. (English) Zbl 1455.91034 Oper. Res. 66, No. 2, 327-339 (2018). MSC: 91A14 91A25 91A43 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Schiopu, Camelia; Ciurea, Eleonor Maximum flows in planar dynamic networks with lower bounds. (English) Zbl 1416.90055 Fundam. Inform. 163, No. 2, 189-204 (2018). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Hanawa, Yosuke; Higashikawa, Yuya; Kamiyama, Naoyuki; Katoh, Naoki; Takizawa, Atsushi The mixed evacuation problem. (English) Zbl 1414.90305 J. Comb. Optim. 36, No. 4, 1299-1314 (2018). MSC: 90B10 05C20 90B06 90C35 × Cite Format Result Cite Review PDF Full Text: DOI Link
Parpalea, Mircea; Avesalon, Nicoleta; Ciurea, Eleonor Minimum parametric flow in time-dependent dynamic networks. (English) Zbl 1400.90067 RAIRO, Theor. Inform. Appl. 52, No. 1, 43-53 (2018). MSC: 90B10 05C82 05C38 05C12 68R10 90C47 × Cite Format Result Cite Review PDF Full Text: DOI
Gottschalk, Corinna; Koster, Arie M. C. A.; Liers, Frauke; Peis, Britta; Schmand, Daniel; Wierz, Andreas Robust flows over time: models and complexity results. (English) Zbl 1405.90135 Math. Program. 171, No. 1-2 (A), 55-85 (2018). MSC: 90C35 05C21 90C05 90C59 90C46 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Higashikawa, Yuya; Cheng, Siu-Wing; Kameda, Tsunehiko; Katoh, Naoki; Saburi, Shun Minimax regret 1-median problem in dynamic path networks. (English) Zbl 1397.90236 Theory Comput. Syst. 62, No. 6, 1392-1408 (2018). MSC: 90B80 90B10 90B06 91A12 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems. (English) Zbl 1457.68308 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 41, 13 p. (2017). MSC: 68W25 05C21 68Q17 68R10 90B10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Martin, Benoît; De Jaeger, Emmanuel; Glineur, François; Latiers, Arnaud A dynamic programming approach to multi-period planning of isolated microgrids. (English) Zbl 1397.90440 Bertsch, Valentin (ed.) et al., Advances in energy system optimization. Proceedings of the first international symposium on energy system optimization, ISECO, Heidelberg, Germany, November 9–10, 2015. Basel: Birkhäuser/Springer (ISBN 978-3-319-51794-0/hbk; 978-3-319-51795-7/ebook). Trends in Mathematics, 123-137 (2017). MSC: 90C90 90C39 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Jane, Chin-Chia; Laih, Yih-Wenn Algorithms for the quickest time distribution of dynamic stochastic-flow networks. (English) Zbl 1392.05049 RAIRO, Oper. Res. 51, No. 4, 1317-1330 (2017). MSC: 05C21 05C85 90B15 90B25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Kozlov, M. V.; Malashenko, Yu. E.; Nazarova, Irina A.; Novikova, N. M. Fuel and energy system control at large-scale damages. I: Network model and software implementation. (English. Russian original) Zbl 1390.93123 J. Comput. Syst. Sci. Int. 56, No. 6, 945-968 (2017); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upr. 2017, No. 6, 50-73 (2017). MSC: 93A30 90B15 93C73 × Cite Format Result Cite Review PDF Full Text: DOI
Saho, Masahide; Shigeno, Maiko Cancel-and-tighten algorithm for quickest flow problems. (English) Zbl 1390.90122 Networks 69, No. 2, 179-188 (2017). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Büsing, Christina; Koster, Arie; Kirchner, Sarah; Thome, Annika The budgeted minimum cost flow problem with unit upgrading cost. (English) Zbl 1390.90096 Networks 69, No. 1, 67-82 (2017). MSC: 90B10 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Anacleto, Osvaldo; Queen, Catriona Dynamic chain graph models for time series network data. (English) Zbl 1384.62285 Bayesian Anal. 12, No. 2, 491-509 (2017). MSC: 62M10 62F15 62M20 × Cite Format Result Cite Review PDF Full Text: DOI Euclid
Wang, Li; Lin, Shimin; Yang, Jingfeng; Zhang, Nanfeng; Yang, Ji; Li, Yong; Zhou, Handong; Yang, Feng; Li, Zhifu Dynamic traffic congestion simulation and dissipation control based on traffic flow theory model and neural network data calibration algorithm. (English) Zbl 1380.93053 Complexity 2017, Article ID 5067145, 11 p. (2017). MSC: 93A30 90B20 93B20 × Cite Format Result Cite Review PDF Full Text: DOI
Yuan, Yuan; Tang, Lixin Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse. (English) Zbl 1375.90141 Eur. J. Oper. Res. 262, No. 2, 424-437 (2017). MSC: 90B35 90B06 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Bonami, Pierre; Mazauric, Dorian; Vaxès, Yann Maximum flow under proportional delay constraint. (English) Zbl 1373.90023 Theor. Comput. Sci. 689, 58-66 (2017). MSC: 90B10 68Q25 90C35 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Bozhenyuk, Aleksandr Vital’evich’; Gerasimenko, Evgeniya Michaĭlovna Finding the maximum flow of minimum cost in fuzzy dynamic network with a given vitality degree. (Russian. English summary) Zbl 1452.90078 Nechetkie Sist. Myagkie Vychisl. 11, No. 2, 83-94 (2016). MSC: 90B10 × Cite Format Result Cite Review PDF
Weber, Melanie; Jost, Jürgen; Saucan, Emil Forman-Ricci flow for change detection in large dynamic data sets. (English) Zbl 1422.53054 Axioms 5, No. 4, Paper No. 26, 12 p. (2016). MSC: 53C44 53C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Schiopu, Camelia The maximum flows in bipartite dynamic networks. The static approach. (English) Zbl 1413.90050 An. Univ. Craiova, Ser. Mat. Inf. 43, No. 2, 200-209 (2016). MSC: 90B10 90C35 05C35 68R10 × Cite Format Result Cite Review PDF
Avesalon, Nicoleta Maximum flows in parametric dynamic networks with lower bounds. (English) Zbl 1413.90047 An. Univ. Craiova, Ser. Mat. Inf. 43, No. 2, 188-199 (2016). MSC: 90B10 × Cite Format Result Cite Review PDF
Chen, Di; Golin, Mordecai Sink evacuation on trees with dynamic confluent flows. (English) Zbl 1398.05098 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 25, 13 p. (2016). MSC: 05C21 05C05 05C22 05C35 05C85 68Q25 90B10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Banikhademi, Hajar; Fathabadi, Hasan Salehi A solution to the inverse minimum cut problem in dynamic network flows. (English) Zbl 1356.90030 Adv. Appl. Stat. 49, No. 4, 267-285 (2016). MSC: 90B10 90C35 90C05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Ahmed, Shabbir; He, Qie; Li, Shi; Nemhauser, George L. On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. (English) Zbl 1349.90153 SIAM J. Optim. 26, No. 4, 2059-2079 (2016). MSC: 90B10 90B30 90C26 90C27 90C39 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Grosso, Juan M.; Ocampo-Martinez, Carlos; Puig, Vicenç Reliability-based economic model predictive control for generalised flow-based networks including actuators’ health-aware capabilities. (English) Zbl 1347.93123 Int. J. Appl. Math. Comput. Sci. 26, No. 3, 641-654 (2016). MSC: 93B40 90B25 90B15 93C95 × Cite Format Result Cite Review PDF Full Text: DOI
Higashikawa, Yuya; Cheng, Siu-Wing; Kameda, Tsunehiko; Katoh, Naoki; Saburi, Shun Minimax regret 1-median problem in dynamic path networks. (English) Zbl 1397.90235 Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44542-7/pbk; 978-3-319-44543-4/ebook). Lecture Notes in Computer Science 9843, 122-134 (2016). MSC: 90B80 90B10 90B06 91A12 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Groß, Martin; Skutella, Martin A tight bound on the speed-up through storage for quickest multi-commodity flows. (English) Zbl 1408.90049 Oper. Res. Lett. 43, No. 1, 93-95 (2015). MSC: 90B10 90B06 90C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Mattia, Sara The cut property under demand uncertainty. (English) Zbl 1390.90176 Networks 66, No. 2, 159-168 (2015). MSC: 90B18 × Cite Format Result Cite Review PDF Full Text: DOI
Arulselvan, Ashwin; Groß, Martin; Skutella, Martin Graph orientation and flows over time. (English) Zbl 1390.90089 Networks 66, No. 3, 196-209 (2015). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Hsu, Yu-Ting; Peeta, Srinivas Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations. (English) Zbl 1338.90051 Netw. Spat. Econ. 15, No. 3, 743-764 (2015). MSC: 90B06 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Bertsekas, Dimitri P.; Tsitsiklis, John N. Parallel and distributed computation: numerical methods. Reprint of the 1989 edition published by Prentice-Hall. (English) Zbl 1325.65001 Belmont, MA: Athena Scientific (ISBN 978-1-886529-15-1/hbk). xix, 715 p., 95 p./solutions manual (pdf). (2015). MSC: 65-02 65Yxx 68W15 65F05 65F10 65H10 65K05 65K10 × Cite Format Result Cite Review PDF
Turner, Lara; Groß, Dwi Poetranto; Hamacher, Horst W.; Krumke, Sven O. Rejoinder on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90031 Top 23, No. 3, 665-668 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Sforza, Antonio; Sterle, Claudio Comments on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90029 Top 23, No. 3, 660-664 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Ruzika, Stefan; Torchiani, Carolin Comments on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90027 Top 23, No. 3, 655-659 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Labbé, Martine Comments on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90026 Top 23, No. 3, 652-654 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Kara, Bahar Y. Comments on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90025 Top 23, No. 3, 650-651 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Carrizosa, Emilio Comments on: “Static and dynamic source locations in undirected networks”. (English) Zbl 1327.90022 Top 23, No. 3, 647-649 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Turner, Lara; Groß, Dwi Poetranto; Hamacher, Horst W.; Krumke, Sven O. Static and dynamic source locations in undirected networks. (English) Zbl 1327.90030 Top 23, No. 3, 619-646 (2015). MSC: 90B10 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai J.; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng Minimax regret 1-sink location problem in dynamic path networks. (English) Zbl 1326.90044 Theor. Comput. Sci. 588, 24-36 (2015). MSC: 90B80 68W40 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Ni, Guanqun; Xu, Yinfeng; Dong, Yucheng Minimax regret k-sink location problem in dynamic path networks. (English) Zbl 1445.90016 Gu, Qianping (ed.) et al., Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8546, 23-31 (2014). MSC: 90B10 68W40 90B80 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Yang, Jianfang; Gao, Yan An emergency evacuation model and an algorithm with the limited number of rescue equipments. (Chinese. English summary) Zbl 1313.90037 Oper. Res. Trans. 18, No. 2, 77-86 (2014). MSC: 90B10 90C27 90C90 × Cite Format Result Cite Review PDF
Kamiyama, Naoyuki; Katoh, Naoki The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths. (English) Zbl 1303.90014 Discrete Appl. Math. 178, 89-100 (2014). MSC: 90B10 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Shao, Mingfu; Moret, Bernard M. E. On the DCJ median problem. (English) Zbl 1411.92201 Kulikov, Alexander S. (ed.) et al., Combinatorial pattern matching. 25th annual symposium, CPM 2014, Moscow, Russia, June 16–18, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8486, 273-282 (2014). MSC: 92D10 92C42 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki Minimax regret sink location problem in dynamic tree networks with uniform capacity. (English) Zbl 1302.90103 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and computation. 8th international workshop, WALCOM 2014, Chennai, India, February 13–15, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-04656-3/pbk). Lecture Notes in Computer Science 8344, 125-137 (2014). MSC: 90B80 68W40 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Almodóvar, M.; García-Ródenas, R. On-line reschedule optimization for passenger railways in case of emergencies. (English) Zbl 1349.90307 Comput. Oper. Res. 40, No. 3, 725-736 (2013). MSC: 90B35 90C39 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Tanaka, Ken-ichi; Furuta, Takehiro Locations and service start time of flow-covering facilities with multiple coverage levels. (English) Zbl 1291.90122 J. Oper. Res. Soc. Japan 56, No. 3, 177-197 (2013). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Ogier, Maxime; Cung, Van-Dat; Boissière, Julien Service network design in short and local fresh food supply chain. (English) Zbl 1282.90037 RAIRO, Oper. Res. 47, No. 4, 445-464 (2013). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Guan, Yongpei; Yang, Kang-Hung; Zhou, Zhili The crane scheduling problem: models and solution approaches. (English) Zbl 1269.90041 Ann. Oper. Res. 203, 119-139 (2013). MSC: 90B35 × Cite Format Result Cite Review PDF Full Text: DOI
Cheng, Siu-Wing; Higashikawa, Yuya; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng Minimax regret 1-sink location problems in dynamic path networks. (English) Zbl 1302.90101 Chan, T-H. Hubert (ed.) et al., Theory and applications of models of computation. 10th international conference, TAMC 2013, Hong Kong, China, May 20–22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38235-2/pbk). Lecture Notes in Computer Science 7876, 121-132 (2013). MSC: 90B80 68W40 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Rungta, Mukesh; Lim, Gino J.; Baharnemati, MohammadReza Optimal egress time calculation and path generation for large evacuation networks. (English) Zbl 1260.90044 Ann. Oper. Res. 201, 403–421 (2012). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Salehi Fathabadi, Hassan; Khodayifar, S.; Raayatpanah, M. A. Minimum flow problem on network flows with time-varying bounds. (English) Zbl 1252.90013 Appl. Math. Modelling 36, No. 9, 4414-4421 (2012). MSC: 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Tanaka, Ken-ichi Maximum flow-covering location and service start time problem and its application to Tokyo metropolitan railway network. (English) Zbl 1254.90101 J. Oper. Res. Soc. Japan 54, No. 4, 237-258 (2011). MSC: 90B80 90B10 90C10 90B90 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
Parpalea, Mircea A parametric approach to the Bi-Criteria minimum cost dynamic flow problem. (English) Zbl 1245.90135 Open J. Discrete Math. 1, No. 3, 116-126 (2011). MSC: 90C35 90C29 90C31 × Cite Format Result Cite Review PDF Full Text: DOI
Parpalea, Mircea Network simplex algorithm for the bi-criteria minimum cost flow over time problem. (English) Zbl 1249.90033 Bull. Transilv. Univ. Brașov, Ser. III, Math. Inform. Phys. 4(53), 117-128 (2011). MSC: 90B10 90C35 90C47 05C35 68R10 × Cite Format Result Cite Review PDF
Gao, Hongwei; Liu, Zuoyi; Dai, Yeming The dynamic procedure of information flow network. (English) Zbl 1229.91082 Petrosyan, Leon A. (ed.) et al., Contributions to game theory and management. Vol. IV. The 4th international conference game theory and management (GTM 2010), June 28–30, 2010, St. Petersburg, Russia. Collected papers. St. Petersburg: Graduate School of Management, St. Petersburg University (ISBN 978-5-9924-0069-4/pbk). 172-187 (2011). MSC: 91A43 91A80 × Cite Format Result Cite Review PDF
Dressler, Daniel; Skutella, Martin An FPTAS for flows over time with aggregate arc capacities. (English) Zbl 1314.68395 Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 106-117 (2011). MSC: 68W25 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Fonoberova, Maria Algorithms for finding optimal flows in dynamic networks. (English) Zbl 1359.90014 Rebennack, Steffen (ed.) et al., Handbook of power systems. II. Dordrecht: Springer (ISBN 978-3-642-12685-7/hbk; 978-3-642-26459-7/pbk; 978-3-642-12686-4/ebook). Energy Systems, 31-54 (2010). MSC: 90B10 × Cite Format Result Cite Review PDF Full Text: DOI