{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:47:47Z","timestamp":1772776067200,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642220111","type":"print"},{"value":"9783642220128","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_44","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T03:29:39Z","timestamp":1308367779000},"page":"552-563","source":"Crossref","is-referenced-by-count":13,"title":["Existence and Uniqueness of Equilibria for Flows over Time"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Cominetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Correa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omar","family":"Larr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","first-page":"369","volume-title":"Probability, Statistics and Optimisation","author":"E.J. Anderson","year":"1994","unstructured":"Anderson, E.J., Philpott, A.B.: Optimisation of flows in networks over time. In: Kelly, F.P. (ed.) Probability, Statistics and Optimisation, pp. 369\u2013382. Wiley, New York (1994)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Fleischer, L., Anshelevich, E.: A stackelberg strategy for routing flow over time. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 192\u2013201 (2011)","DOI":"10.1137\/1.9781611973082.18"},{"key":"44_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70914-7","volume-title":"Functional Analysis, Sobolev Spaces and Partial Differential Equations","author":"H. Brezis","year":"2010","unstructured":"Brezis, H.: Functional Analysis, Sobolev Spaces and Partial Differential Equations. Springer, New York (2010)"},{"key":"44_CR4","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F. Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol.\u00a0I. Springer, New York (2003)"},{"issue":"3-5","key":"44_CR5","first-page":"71","volume":"23","author":"L. Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, E.: Efficient continuous-time dynamic network flow algorithms. Operations Research\u00a023(3-5), 71\u201380 (1998)","journal-title":"Operations Research"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"44_CR7","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"44_CR8","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. Michigan Mathematical Journal\u00a06, 59\u201363 (1959)","journal-title":"Michigan Mathematical Journal"},{"key":"44_CR9","unstructured":"Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory of Computing Systems (to appear)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-16170-4_23","volume-title":"Algorithmic Game Theory","author":"M. Macko","year":"2010","unstructured":"Macko, M., Larson, K., Steskal, \u013d.: Braess\u2019s Paradox for Flows over Time. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) Algorithmic Game Theory. LNCS, vol.\u00a06386, pp. 262\u2013275. Springer, Heidelberg (2010)"},{"key":"44_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modeling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran, B., Boyce, D.: Modeling Dynamic Transportation Networks. Springer, Berlin (1996)"},{"key":"44_CR12","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., Lovasz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Berlin (2009)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:25:40Z","timestamp":1553811940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}