{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:51:45Z","timestamp":1648576305824},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10589-007-9153-6","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T11:46:30Z","timestamp":1196682390000},"page":"289-313","source":"Crossref","is-referenced-by-count":4,"title":["Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Dulce","family":"Rosas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00eddia","family":"Montero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"9153_CR1","unstructured":"Aashtiani, H.Z., Magnanti, T.L.: A linearization and decomposition algorithm for computing urban traffic equilibria. In: Proceedings of the IEEE Large Scale Systems Symposium, pp.\u00a08\u201319, 1982"},{"key":"9153_CR2","volume-title":"Optimization. M\u00e9todes Num\u00e9riques","author":"A. Auslender","year":"1976","unstructured":"Auslender, A.: Optimization. M\u00e9todes Num\u00e9riques. Masson, Paris (1976)"},{"issue":"4","key":"9153_CR3","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(4), 398\u2013417 (2002)","journal-title":"Transp. Sci."},{"key":"9153_CR4","unstructured":"Beckmann, M.J., McGuire, C., Wisten, C.: Studies in the economics of transportation (1956)"},{"key":"9153_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0120965","volume":"17","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas, D.P., Gafni, E.M.: Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Study 17, 139\u2013159 (1982)","journal-title":"Math. Program. Study"},{"key":"9153_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/trsc.14.1.42","volume":"14","author":"S. Dafermos","year":"1980","unstructured":"Dafermos, S.: Traffic equilibrium and variational inequalities. Transp. Sci. 14, 42\u201354 (1980)","journal-title":"Transp. Sci."},{"key":"9153_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/trsc.16.2.231","volume":"16","author":"S. Dafermos","year":"1982","unstructured":"Dafermos, S.: Relaxation algorithms for the general asymmetric traffic equilibrium problem. Transp. Sci. 16, 231\u2013240 (1982)","journal-title":"Transp. Sci."},{"key":"9153_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1008671815550","volume":"12","author":"M. Denault","year":"1999","unstructured":"Denault, M., Goffin, J.L.: On a primal-dual analytic center cutting plan method for variational inequalities. Comput. Optim. Appl. 12, 127\u2013156 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9153_CR9","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems, vols.\u00a0I\u2013II","author":"F. Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vols.\u00a0I\u2013II. Springer, New York (2003)"},{"key":"9153_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121092","volume":"26","author":"M. Florian","year":"1986","unstructured":"Florian, M.: Nonlinear cost network models in transportation analysis. Math. Program. Study 26, 167\u2013196 (1986)","journal-title":"Math. Program. Study"},{"key":"9153_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/0191-2615(82)90007-8","volume":"16B","author":"M. Florian","year":"1982","unstructured":"Florian, M., Spiess, H.: The convergence of diagonalization algorithms for asymmetric network equilibrium problems. Transp. Res. 16B, 477\u2013483 (1982)","journal-title":"Transp. Res."},{"key":"9153_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"9153_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"M. Fukushima","year":"1986","unstructured":"Fukushima, M.: A relaxed projection method for variational inequalities. Math. Program. 35, 58\u201370 (1986)","journal-title":"Math. Program."},{"issue":"5","key":"9153_CR14","first-page":"701","volume":"32","author":"M. Fukushima","year":"1987","unstructured":"Fukushima, M., Itoh, T.: A dual approach to asymmetric traffic equilibrium problems. Math. Jpn. 32(5), 701\u2013721 (1987)","journal-title":"Math. Jpn."},{"key":"9153_CR15","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38-2","author":"J.-L. Goffin","year":"1992","unstructured":"Goffin, J.-L., Haurie, A., Vial, J.-P.: Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 38-2, 284\u2013302 (1992)","journal-title":"Manag. Sci."},{"key":"9153_CR16","first-page":"131","volume":"76","author":"J.-L. Goffin","year":"1997","unstructured":"Goffin, J.-L., Gondzio, J., Sarkissian, R., Vial, J.-P.: Solving nonlinear multicommodity problems by the analytic center cutting plane method. Math. Program. 76, 131\u2013154 (1997)","journal-title":"Math. Program."},{"key":"9153_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(96)00029-6","volume":"20","author":"J.-L. Goffin","year":"1997","unstructured":"Goffin, J.-L., Marcotte, P., Zhu, D.: An analytic cutting plane method for pseudo-monotone variational inequalities. Oper. Res. Lett. 20, 1\u20136 (1997)","journal-title":"Oper. Res. Lett."},{"key":"9153_CR18","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/S0377-2217(96)00182-8","volume":"101","author":"J.-L. Goffin","year":"1997","unstructured":"Goffin, J.-L., Sarkissian, R., Vial, J.-P.: Using an interior point method for the master problem in a decomposition approach. Eur. J. Oper. Res. 101, 577\u2013587 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9153_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","volume":"31","author":"D.W. Hearn","year":"1987","unstructured":"Hearn, D.W., Lawphongpanich, S., Ventura, J.A.: Restricted simplicial decomposition: computation and extensions. Math. Program. Study 31, 99\u2013118 (1987)","journal-title":"Math. Program. Study"},{"issue":"2","key":"9153_CR20","doi-asserted-by":"crossref","first-page":"174","DOI":"10.15807\/jorsj.32.174","volume":"32","author":"R. Katsura","year":"1989","unstructured":"Katsura, R., Fukushima, M., Ibaraki, T.: Interior methods for nonlinear minimum cost network flow problems. J. Oper. Res. Soc. Jpn. 32(2), 174\u2013199 (1989)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9153_CR21","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.26.1.4","volume":"26","author":"T. Larsson","year":"1992","unstructured":"Larsson, T., Patriksson, M.: Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transp. Sci. 26, 4\u201317 (1992)","journal-title":"Transp. Sci."},{"key":"9153_CR22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0191-2615(84)90026-2","volume":"18B","author":"S. Lawphongpanich","year":"1984","unstructured":"Lawphongpanich, S., Hearn, D.W.: Simplicial decomposition of the asymmetric traffic assignment problem. Transp. Res. 18B, 123\u2013133 (1984)","journal-title":"Transp. Res."},{"key":"9153_CR23","first-page":"97","volume":"38","author":"S. Lawphongpanich","year":"1986","unstructured":"Lawphongpanich, S., Hearn, D.W.: Restricted simplicial decomposition with application to the traffic assignment problem. Ric. Oper. 38, 97\u2013120 (1986)","journal-title":"Ric. Oper."},{"key":"9153_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"L.J. LeBlanc","year":"1975","unstructured":"LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309\u2013318 (1975)","journal-title":"Transp. Res."},{"key":"9153_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01584381","volume":"33","author":"P. Marcotte","year":"1985","unstructured":"Marcotte, P.: A new algorithm for solving the variational inequalities with application to the traffic assignment problem. Math. Program. Study 33, 339\u2013351 (1985)","journal-title":"Math. Program. Study"},{"key":"9153_CR26","doi-asserted-by":"crossref","unstructured":"Marcotte, P., Dussault, J.-P.: A modified newton method for solving variational inequalities. In: Proceedings of the 24th IEEE Conference on Decision and Control, vol.\u00a033, pp.\u00a01433\u20131436, 1985","DOI":"10.1109\/CDC.1985.268747"},{"issue":"2","key":"9153_CR27","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/trsc.22.2.112","volume":"22","author":"P. Marcotte","year":"1988","unstructured":"Marcotte, P., Gu\u00e9lat, J.: Adaptation of a modified newton method for solving the asymmetric traffic equilibrium problem. Transp. Sci. 22(2), 112\u2013124 (1988)","journal-title":"Transp. Sci."},{"key":"9153_CR28","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0002-9904-1967-11732-4","volume":"73","author":"G.J. Minty","year":"1967","unstructured":"Minty, G.J.: On the generalization of a direct method of the calculus of variations. Bull. Am. Math. Soc. 73, 315\u2013321 (1967)","journal-title":"Bull. Am. Math. Soc."},{"key":"9153_CR29","unstructured":"Montero, L.: A simplicial decomposition approach for solving the variational inequality formulation of the general traffic assignment problem for large scale networks. PhD thesis, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain (1992)"},{"issue":"2","key":"9153_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02568510","volume":"4","author":"L. Montero","year":"1996","unstructured":"Montero, L., Barcel\u00f3, J.: A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale networks. TOP 4(2), 225\u2013256 (1996)","journal-title":"TOP"},{"key":"9153_CR31","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"9153_CR32","unstructured":"Nesterov, Y., Vial, J.-P.: Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. Tech. Rep. 4 Logilab (1997)"},{"key":"9153_CR33","volume-title":"Traffic Flow on Transportation Networks","author":"G. Newell","year":"1980","unstructured":"Newell, G.: Traffic Flow on Transportation Networks. MIT Press, Cambridge (1980)"},{"key":"9153_CR34","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.18.2.185","volume":"18","author":"S. Nguyen","year":"1984","unstructured":"Nguyen, S., Dupuis, C.: An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transp. Sci. 18, 185\u2013202 (1984)","journal-title":"Transp. Sci."},{"key":"9153_CR35","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 B.V., Zeist (1994)"},{"key":"9153_CR36","volume-title":"Nonlinear Programming and Variational Inequality Problems\u2014A Unified Approach","author":"M. Patriksson","year":"1998","unstructured":"Patriksson, M.: Nonlinear Programming and Variational Inequality Problems\u2014A Unified Approach. Kluwer Academic, Dordrecht (1998)"},{"key":"9153_CR37","unstructured":"Rosas, D., Castro, J., Montero, L.: Solving the traffic assignment problem using ACCPM. Tech. Rep. DR 2002-18, Statistics and Operation Research Department: Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain (2002)"},{"key":"9153_CR38","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0191-2615(79)90022-5","volume":"13B","author":"M.J. Smith","year":"1979","unstructured":"Smith, M.J.: Existence, uniqueness and stability of traffic equilibria. Transp. Res. 13B, 295\u2013304 (1979)","journal-title":"Transp. Res."},{"key":"9153_CR39","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0191-2615(83)90047-4","volume":"17B","author":"M.J. Smith","year":"1983","unstructured":"Smith, M.J.: The existence and calculation of traffic equilibria. Transp. Res. 17B, 291\u2013303 (1983)","journal-title":"Transp. Res."},{"key":"9153_CR40","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0191-2615(83)90003-6","volume":"17B","author":"M.J. Smith","year":"1983","unstructured":"Smith, M.J.: An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Transp. Res. 17B, 365\u2013371 (1983)","journal-title":"Transp. Res."},{"issue":"5","key":"9153_CR41","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1137\/S0363012994268655","volume":"34","author":"M. Solodov","year":"1996","unstructured":"Solodov, M., Tseng, P.: Modified projection-type methods for monotone variational inequalities. SIAM J. Control Optim. 34(5), 1814\u20131830 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"9153_CR42","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: New algorithms in convex programming based on a notion of \u201ccentre\u201d (for systems of analytic inequalities) and on rational extrapolation, Trends Math. Optim. 311\u2013326 (1988)","DOI":"10.1007\/978-3-0348-9297-1_20"},{"key":"9153_CR43","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, vol.\u00a01, pp.\u00a0325\u2013378, 1952"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9153-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9153-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9153-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:34Z","timestamp":1559288194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9153-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9153"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9153-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}