Figueroa González, José Luis; Baiou, Mourad; Quilliot, Alain; Toussaint, Hélène; Wagler, Annegret A project and lift approach for a 2-commodity flow relocation model in a time expanded network. (English) Zbl 07894691 Discrete Appl. Math. 356, 350-368 (2024). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Gupta, Shiva Prakash; Pyakurel, Urmila; Dhamala, Tanka Nath Optimal reconfiguration of network with variant transmission times on arcs. (English) Zbl 1549.90031 Nepali Math. Sci. Rep. 40, No. 1-2, 11-33 (2023). MSC: 90B10 90C27 68Q25 90B06 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
He, Edward; Boland, Natashia; Nemhauser, George; Savelsbergh, Martin An exact algorithm for the service network design problem with hub capacity constraints. (English) Zbl 1528.90109 Networks 80, No. 4, 572-596 (2022). MSC: 90B35 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Figueroa González, José Luis; Baïou, Mourad; Quilliot, Alain; Toussaint, Hélène; Wagler, Annegret Branch-and-cut for a 2-commodity flow relocation model with time constraints. (English) Zbl 1528.90054 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 22-34 (2022). MSC: 90B10 90C27 90C57 × Cite Format Result Cite Review PDF Full Text: DOI
He, Edward Yuhang; Boland, Natashia; Nemhauser, George; Savelsbergh, Martin Dynamic discretization discovery algorithms for time-dependent shortest path problems. (English) Zbl 07551227 INFORMS J. Comput. 34, No. 2, 1086-1114 (2022). MSC: 90B10 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
He, Edward; Boland, Natashia; Nemhauser, George; Savelsbergh, Martin Time-dependent shortest path problems with penalties and limits on waiting. (English) Zbl 1492.90027 INFORMS J. Comput. 33, No. 3, 997-1014 (2021). MSC: 90B10 05C38 90B06 × 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
Kira, Akifumi; Kamiyama, Naoyuki; Anai, Hirokazu; Iwashita, Hiroaki; Ohori, Kotaro On dynamic patrolling security games. (English) Zbl 1452.91059 J. Oper. Res. Soc. Japan 62, No. 4, 152-168 (2019). MSC: 91A65 90C40 × Cite Format Result Cite Review PDF
Boland, Natashia L.; Savelsbergh, Martin W. P. Perspectives on integer programming for time-dependent models. (English) Zbl 1418.90160 Top 27, No. 2, 147-173 (2019). MSC: 90C10 90C90 × Cite Format Result Cite Review PDF Full Text: DOI
He, Edward; Boland, Natashia; Nemhauser, George; Savelsbergh, Martin A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem. (English) Zbl 1511.90403 van Hoeve, Willem-Jan (ed.), Integration of constraint programming, artificial intelligence, and operations research. 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10848, 289-297 (2018). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Scheffler, Robert; Strehler, Martin Optimizing traffic signal settings for public transport priority. (English) Zbl 1548.90103 D’Angelo, Gianlorenzo (ed.) et al., 17th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS 2017, Vienna, Austria, September 7–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 59, Article 9, 15 p. (2017). MSC: 90B06 90B20 90B35 × Cite Format Result Cite Review PDF Full Text: DOI
Di Bartolomeo, Marco; Grande, Enrico; Nicosia, Gaia; Pacifici, Andrea Cheapest paths in dynamic networks. (English) Zbl 1390.90155 Networks 69, No. 1, 23-32 (2017). MSC: 90B18 90C57 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Boland, Natashia; Hewitt, Mike; Marshall, Luke; Savelsbergh, Martin The continuous-time service network design problem. (English) Zbl 1380.90069 Oper. Res. 65, No. 5, 1303-1321 (2017). MSC: 90B10 90B06 × Cite Format Result Cite Review PDF Full Text: DOI Link
Scheffler, Robert; Strehler, Martin Optimizing traffic signal timings for mega events. (English) Zbl 1432.90036 Goerigk, Marc (ed.) et al., 16th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’16, Aarhus, Denmark, August 25, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 54, Article 8, 16 p. (2016). MSC: 90B20 90C11 × Cite Format Result Cite Review PDF Full Text: DOI
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
Shu, Jia; Song, Miao Dynamic container deployment: two-stage robust model, complexity, and computational results. (English) Zbl 1356.90026 INFORMS J. Comput. 26, No. 1, 135-149 (2014). MSC: 90B06 90B80 × Cite Format Result Cite Review PDF Full Text: DOI
Fischer, Frank; Helmberg, Christoph Dynamic graph generation for the shortest path problem in time expanded networks. (English) Zbl 1303.90116 Math. Program. 143, No. 1-2 (A), 257-297 (2014). Reviewer: Jaroslav Janáček (Žilina) MSC: 90C35 90C06 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Bish, Douglas R.; Chamberlayne, Edward P.; Rakha, Hesham A. Optimizing network flows with congestion-based flow reductions. (English) Zbl 1339.90077 Netw. Spat. Econ. 13, No. 3, 283-306 (2013). MSC: 90B10 90B20 × Cite Format Result Cite Review PDF Full Text: DOI
Lim, Gino J.; Zangeneh, Shabnam; Baharnemati, M. Reza; Assavapokee, Tiravat A capacitated network flow optimization approach for short notice evacuation planning. (English) Zbl 1253.90149 Eur. J. Oper. Res. 223, No. 1, 234-245 (2012). MSC: 90B90 90B10 90B35 × Cite Format Result Cite Review PDF Full Text: DOI
Zheng, Qipeng P.; Arulselvan, Ashwin Discrete time dynamic traffic assignment models and solution algorithm for managed lanes. (English) Zbl 1230.90140 J. Glob. Optim. 51, No. 1, 47-68 (2011). MSC: 90C11 90B20 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Huang, Hai-Jun; Xu, Gang Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems. (English) Zbl 0957.90054 Eur. J. Oper. Res. 105, No. 1, 52-65 (1998). MSC: 90B35 90B80 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Hane, Christopher A.; Barnhart, Cynthia; Johnson, Ellis L.; Marsten, Roy E.; Nemhauser, George L.; Sigismondi, Gabriele The fleet assignment problem: Solving a large scale integer program. (English) Zbl 0840.90104 Math. Program. 70, No. 2 (A), 211-232 (1995). MSC: 90C10 90B10 90C06 90C11 90C35 × Cite Format Result Cite Review PDF
Hamacher, H. W.; Tufekci, S. On the use of lexicographic min cost flows in evacuation modeling. (English) Zbl 0652.90042 Nav. Res. Logist. 34, No. 4, 487-503 (1987). MSC: 90B10 90B35 90C31 × Cite Format Result Cite Review PDF Full Text: DOI
Ciurêa, E. Two simple versions of dynamic flow algorithms. (English) Zbl 0638.90035 Bul. Univ. Brasov, Ser. C 29, 19-22 (1987). MSC: 90B10 × Cite Format Result Cite Review PDF
Hamacher, Horst W. Maximal dynamic polymatroid flows and applications. (English) Zbl 0594.90023 Discrete Appl. Math. 15, 41-54 (1986). MSC: 90B10 05B35 × Cite Format Result Cite Review PDF Full Text: DOI
Rumchev, V. G.; Mateev, L. N. Solution of the dynamic transportation problem in the network statement by the method of time-expanded network. (Russian. English summary) Zbl 0602.90055 God. Vissh. Uchebn. Zaved., Prilozhna Mat. 19(1984), No. 3, 149-161 (1983). MSC: 90B10 65K05 × Cite Format Result Cite Review PDF
Orlin, James B. Dynamic matchings and quasidynamic fractional matchings. I. (English) Zbl 0526.90089 Networks 13, 551-562 (1983). MSC: 90C35 90C10 65K05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Jarvis, John J.; Ratliff, H. Donald Some equivalent objectives for dynamic network flow problems. (English) Zbl 0486.90042 Manage. Sci. 28, 106-109 (1982). MSC: 90B10 90C35 90B35 × Cite Format Result Cite Review PDF Full Text: DOI