{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:41:01Z","timestamp":1776105661800,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,13]],"date-time":"2014-06-13T00:00:00Z","timestamp":1402617600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10589-014-9668-6","type":"journal-article","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T06:12:26Z","timestamp":1402553546000},"page":"151-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A convergent and efficient decomposition method for the traffic assignment problem"],"prefix":"10.1007","volume":"60","author":[{"given":"David","family":"Di Lorenzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Galligari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Sciandrone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,13]]},"reference":[{"key":"9668_CR1","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1287\/trsc.36.4.398.549","volume":"36","author":"H Bar-Gera","year":"2002","unstructured":"Bar-Gera, H.: Origin-based algorithm for the traffic assignment problem. Transp. Sci. 36, 398\u2013417 (2002)","journal-title":"Transp. Sci."},{"key":"9668_CR2","first-page":"1022","volume":"44","author":"H Bar-Gera","year":"2010","unstructured":"Bar-Gera, H.: Traffic assignment by paired alternative segments. Transp. Sci. B 44, 1022\u20131046 (2010)","journal-title":"Transp. Sci. B"},{"key":"9668_CR3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.trb.2013.08.018","volume":"57","author":"H Bar-Gera","year":"2013","unstructured":"Bar-Gera, H., Hellman, F., Patriksson, M.: Computational precision of traffic equilibria sensitivities in automatic network design and road pricing. Transp. Res. B 57, 485\u2013500 (2013)","journal-title":"Transp. Res. B"},{"key":"9668_CR4","volume-title":"Parallel and distributed computation: numerical methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and distributed computation: numerical methods. Prentice-Hall Inc, Upper Saddle River (1989)"},{"key":"9668_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"738","author":"SC Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Natl. Bur. Stand. 738, 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"10","key":"9668_CR6","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/j.trb.2006.02.008","volume":"40","author":"RB Dial","year":"2006","unstructured":"Dial, R.B.: A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp. Res. B 40(10), 917\u2013936 (2006)","journal-title":"Transp. Res. B"},{"issue":"0361\u20131981","key":"9668_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.3141\/2090-02","volume":"2090","author":"M Florian","year":"2009","unstructured":"Florian, M., Constantin, I., Florian, D.: A new look at projected gradient method for equilibrium assignment. J. Transp. Res. Rec. Board 2090(0361\u20131981), 10\u201316 (2009)","journal-title":"J. Transp. Res. Rec. Board"},{"key":"9668_CR8","first-page":"485","volume-title":"Hanbooks in OR & MS","author":"M Florian","year":"1995","unstructured":"Florian, M., Hearn, D.W.: Chapter Network Equilibrium Models. Hanbooks in OR & MS, vol. 8, pp. 485\u2013550. Elsevier, Amsterdam (1995)"},{"key":"9668_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","volume":"18B","author":"M Fukushima","year":"1984","unstructured":"Fukushima, M.: A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transp. Res. 18B, 169\u2013177 (1984)","journal-title":"Transp. Res."},{"key":"9668_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.26.1.4","volume":"26","author":"M Patriksson","year":"1992","unstructured":"Patriksson, M., Larsson, T.: Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp. Sci. 26, 4\u201317 (1992)","journal-title":"Transp. Sci."},{"key":"9668_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/trsc.19.4.445","volume":"19","author":"RV LeBlanc","year":"1985","unstructured":"LeBlanc, R.V., Helgason, L.J., Boyce, D.E.: Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transp. Sci. 19, 445\u2013462 (1985)","journal-title":"Transp. Sci."},{"issue":"6","key":"9668_CR12","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"Lin Chih-Jen","year":"2001","unstructured":"Chih-Jen, Lin: On the convergence of the decomposition method for support vector machines. IEEE Trans. Neural Netw. 12(6), 1288\u20131298 (2001)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9668_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10589-007-9044-x","volume":"38","author":"S Lucidi","year":"2007","unstructured":"Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds. Comput. Optim. Appl. 38, 217\u2013234 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9668_CR14","volume-title":"Transportation, in the series Handbooks in Operations Research and Management Science","author":"P Marcotte","year":"2007","unstructured":"Marcotte, P., Patriksson, M.: Traffic equilibrium. In: Barnhart, C., Laporte, G. (eds.) Transportation, in the series Handbooks in Operations Research and Management Science. North-Holland, Amsterdam (2007)"},{"issue":"2","key":"9668_CR15","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/trsc.1120.0409","volume":"47","author":"Mitradjieva Maria","year":"2013","unstructured":"Maria, Mitradjieva, Olov, Lindberg Per: The stiff is moving: conjugate direction Frank-Wolfe methods with applications to traffic assignment. Transp. Sci. 47(2), 280\u2013293 (2013)","journal-title":"Transp. Sci."},{"key":"9668_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.trb.2009.06.005","volume":"44","author":"Y Nie","year":"2010","unstructured":"Nie, Y.: A class of bush-based algorithms for the traffic assignment problem. Transp. Res. B 44, 73\u201389 (2010)","journal-title":"Transp. Res. B"},{"key":"9668_CR17","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M Patriksson","year":"1994","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. VSP, Zeist (1994)"},{"key":"9668_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/B:NETS.0000015654.56554.31","volume":"4","author":"M Patriksson","year":"2004","unstructured":"Patriksson, M.: Algorithms for computing traffic equilibria. Netw. Spat. Econ. 4, 23\u201334 (2004)","journal-title":"Netw. Spat. Econ."},{"key":"9668_CR19","volume-title":"Advances in Kernel Methods: Support Vector Learning","author":"J Platt","year":"1998","unstructured":"Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Schoelkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods: Support Vector Learning. MIT Press, Cambridge (1998)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9668-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9668-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9668-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T14:37:37Z","timestamp":1559227057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9668-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,13]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9668"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9668-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,13]]}}}