{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:32:05Z","timestamp":1778499125264,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457709","type":"print"},{"value":"9783030457716","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45771-6_11","type":"book-chapter","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T21:03:32Z","timestamp":1586811812000},"page":"130-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Flows over Time with Scheduling Costs"],"prefix":"10.1007","author":[{"given":"Dario","family":"Frascaria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0094-1190(90)90028-L","volume":"27","author":"R Arnott","year":"1990","unstructured":"Arnott, R., de Palma, A., Lindsey, R.: Economics of a bottleneck. J. Urban Econ. 27(1), 111\u2013130 (1990)","journal-title":"J. Urban Econ."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baumann, N., Skutella, M.: Solving evacuation problems efficiently-earliest arrival flows with multiple sources. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 399\u2013410 (2006)","DOI":"10.1109\/FOCS.2006.70"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Fleischer, L., Anshelevich, E.: A Stackelberg strategy for routing flow over time. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), pp. 192\u2013201 (2011)","DOI":"10.1137\/1.9781611973082.18"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1287\/opre.2015.1348","volume":"63","author":"R Cominetti","year":"2015","unstructured":"Cominetti, R., Correa, J., Larr\u00e9, O.: Dynamic equilibria in fluid queueing networks. Oper. Res. 63(1), 21\u201334 (2015)","journal-title":"Oper. Res."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-59250-3_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Cominetti","year":"2017","unstructured":"Cominetti, R., Correa, J., Olver, N.: Long term behavior of dynamic equilibria in fluid queuing networks. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 161\u2013172. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_14"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Correa, J.R., Cristi, A., Oosterwijk, T.: On the price of anarchy for flows over time. In: Proceedings of the 2019 ACM Conference on Economics and Computation, (EC), pp. 559\u2013577 (2019)","DOI":"10.1145\/3328526.3329593"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Disser, Y., Skutella, M.: The simplex algorithm is NP-mighty. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), pp. 858\u2013872 (2015)","DOI":"10.1137\/1.9781611973730.59"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, E.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3), 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"11_CR11","unstructured":"Frascaria, D., Olver, N., Verhoef, E.T.: Emergent hypercongestion in Vickrey bottleneck networks. Preprint, Tinbergen Institute Discussion Paper TI 2020\u2013002\/VIII (2020). https:\/\/papers.tinbergen.nl\/20002.pdf"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Mich. Math. J. 6(1), 59\u201363 (1959)","journal-title":"Mich. Math. J."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/mnsc.18.3.157","volume":"18","author":"R Grinold","year":"1971","unstructured":"Grinold, R.: Infinite horizon programs. Manage. Sci. 18, 157\u2013170 (1971)","journal-title":"Manage. Sci."},{"key":"11_CR14","unstructured":"Harks, T.: Pricing in resource allocation games based on duality gaps. Preprint, arXiv:1907.01976 (2019). http:\/\/arxiv.org\/abs\/1907.01976"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"JJ Jarvis","year":"1982","unstructured":"Jarvis, J.J., Ratliff, H.D.: Some equivalent objectives for dynamic network flow problems. Manage. Sci. 28(1), 106\u2013109 (1982)","journal-title":"Manage. Sci."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-010-9299-y","volume":"49","author":"R Koch","year":"2011","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory Comput. Syst. 49(1), 71\u201397 (2011)","journal-title":"Theory Comput. Syst."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-02094-0_9","volume-title":"Algorithmics of Large and Complex Networks","author":"E K\u00f6hler","year":"2009","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Skutella, M.: Traffic networks and flows over time. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 166\u2013196. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02094-0_9"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, (STOC), pp. 1\u201312 (1978)","DOI":"10.1145\/800133.804326"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Oper. Res. 21(2), 517\u2013527 (1973)","journal-title":"Oper. Res."},{"key":"11_CR20","volume-title":"Algorithmic Game Theory","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01585695","volume":"53","author":"HE Romeijn","year":"1992","unstructured":"Romeijn, H.E., Smith, R.L., Bean, J.C.: Duality in infinite dimensional linear programming. Math. Program. 53, 79\u201397 (1992)","journal-title":"Math. Program."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Sering, L., Koch, L.V.: Nash flows over time with spillback. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), pp. 935\u2013945 (2019)","DOI":"10.1137\/1.9781611975482.57"},{"key":"11_CR23","unstructured":"Sering, L., Skutella, M.: Multi-source multi-sink Nash flows over time. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, (ATMOS), pp. 12:1\u201312:20 (2018)"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76796-1_21"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ecotra.2015.01.001","volume":"4","author":"KA Small","year":"2015","unstructured":"Small, K.A.: The bottleneck model: an assessment and interpretation. Econ. Transp. 4(1), 110\u2013117 (2015)","journal-title":"Econ. Transp."},{"issue":"2","key":"11_CR26","first-page":"251","volume":"59","author":"W Vickrey","year":"1969","unstructured":"Vickrey, W.: Congestion theory and transport investment. Am. Econ. Rev. 59(2), 251\u201360 (1969)","journal-title":"Am. Econ. Rev."},{"issue":"7","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"WL Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19(7), 1602\u20131612 (1971)","journal-title":"Oper. Res."},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0191-2615(97)00041-6","volume":"32","author":"H Yang","year":"1998","unstructured":"Yang, H., Meng, Q.: Departure time, route choice and congestion toll in a queuing network with elastic demand. Transp. Res. Part B: Methodol. 32(4), 247\u2013260 (1998)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01580132","volume":"5","author":"N Zadeh","year":"1973","unstructured":"Zadeh, N.: A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Program. 5, 255\u2013266 (1973)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45771-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T16:49:57Z","timestamp":1615222197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45771-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457709","9783030457716"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45771-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}