{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T06:05:23Z","timestamp":1780466723322,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T00:00:00Z","timestamp":1521504000000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10479-018-2817-z","type":"journal-article","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T04:52:45Z","timestamp":1521521565000},"page":"447-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing solutions of the multiclass network equilibrium problem with affine cost functions"],"prefix":"10.1007","volume":"274","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Pradeau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"key":"2817_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0602024","volume":"2","author":"HZ Aashtiani","year":"1981","unstructured":"Aashtiani, H. Z., & Magnanti, T. L. (1981). Equilibria on a congested transportation network. SIAM Journal of Algebraic Discrete Methods, 2, 213\u2013226.","journal-title":"SIAM Journal of Algebraic Discrete Methods"},{"key":"2817_CR2","unstructured":"Adler, I., & Verma, S. (2011). The linear complementarity problem, Lemke algorithm, perturbation, and the complexity class PPAD. Optimization Online."},{"key":"2817_CR3","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River: Prentice-Hall."},{"issue":"2","key":"2817_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.cor.2004.06.005","volume":"33","author":"E Altman","year":"2006","unstructured":"Altman, E., Boulogne, T., El-Azouzi, R., Jim\u00e9nez, T., & Wynter, L. (2006). A survey on networking games in telecommunications. Computers & Operations Research, 33(2), 286\u2013311.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2817_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/moor.4.3.209","volume":"4","author":"R Asmuth","year":"1979","unstructured":"Asmuth, R., Eaves, B. C., & Peterson, E. L. (1979). Computing economic equilibria on affine networks with Lemke\u2019s algorithm. Mathematics of Operations Research, 4(3), 209\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"2817_CR6","volume-title":"Studies in economics of transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C. B., & Winsten, C. B. (1956). Studies in economics of transportation. New Haven, CT: Yale University Press."},{"key":"2817_CR7","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/moor.21.1.44","volume":"21","author":"M Cao","year":"1996","unstructured":"Cao, M., & Ferris, M. C. (1996). A pivotal method for affine variational inequalities. Mathematics of Operations Research, 21, 44\u201364.","journal-title":"Mathematics of Operations Research"},{"key":"2817_CR8","doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, X., & Ten, S.-H. (2009). Settling the complexity of computing two-player Nash equilibria. Journal of the ACM. \n                    https:\/\/doi.org\/10.1145\/1516512.1516516\n                    \n                  .","DOI":"10.1145\/1516512.1516516"},{"key":"2817_CR9","volume-title":"Linear programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V. (1983). Linear programming. New York: W.H. Freeman."},{"key":"2817_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF00940305","volume":"59","author":"G Cohen","year":"1988","unstructured":"Cohen, G., & Chaplais, F. (1988). Nested monotonicity for variational inequalities over product of spaces and convergence of iterative algorithms. Journal of Optimization Theory and Applications, 59, 369\u2013390.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2817_CR11","volume-title":"The linear complementarity problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R. W., Pang, J. S., & Stone, R. E. (1992). The linear complementarity problem. Cambridge: Academic Press."},{"key":"2817_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/trsc.6.1.73","volume":"6","author":"S Dafermos","year":"1972","unstructured":"Dafermos, S. (1972). The traffic assignment problem for multiclass-user transportation networks. Transportation Science, 6, 73\u201387.","journal-title":"Transportation Science"},{"key":"2817_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/trsc.14.1.42","volume":"14","author":"S Dafermos","year":"1980","unstructured":"Dafermos, S. (1980). Traffic equilibrium and variational inequalities. Transportation Science, 14, 42\u201354.","journal-title":"Transportation Science"},{"key":"2817_CR14","doi-asserted-by":"crossref","unstructured":"Devanur, N. R., & Kannan, R. (2008). Market equilibria in polynomial time for fixed number of goods or agents. In FOCS 2008.","DOI":"10.1109\/FOCS.2008.30"},{"key":"2817_CR15","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0124043","volume":"24","author":"B Eaves","year":"1973","unstructured":"Eaves, B. (1973). Polymatrix games with joint constraints. SIAM Journal on Applied Mathematics, 24, 418\u2013423.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2817_CR16","series-title":"EATCS monographs on theoretical computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithm in combinatorial geometry","author":"H Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H. (1987). Algorithm in combinatorial geometry (Vol. 10)., EATCS monographs on theoretical computer science Berlin: Springer."},{"key":"2817_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., & Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing, 15, 341\u2013363.","journal-title":"SIAM Journal on Computing"},{"key":"2817_CR18","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., & Talwar, K. (2004). The complexity of pure Nash equilibria. In STOC\u201904.","DOI":"10.1145\/1007352.1007445"},{"key":"2817_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1287\/trsc.11.2.166","volume":"11","author":"M Florian","year":"1977","unstructured":"Florian, M. (1977). A traffic equilibrium model of travel by car and public transit modes. Transportation Science, 11, 166\u2013179.","journal-title":"Transportation Science"},{"key":"2817_CR20","first-page":"52","volume":"26","author":"M Florian","year":"1999","unstructured":"Florian, M. (1999). Untangling traffic congestion: Application of network equilibrium models in transportation planning. OR\/MS Today, 26, 52\u201357.","journal-title":"OR\/MS Today"},{"key":"2817_CR21","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0191-2615(82)90007-8","volume":"16","author":"M Florian","year":"1982","unstructured":"Florian, M., & Spiess, H. (1982). The convergence of diagonalisation algorithms for asymmetric network equilibrium problems. Transportation Research Part B, 16, 477\u2013483.","journal-title":"Transportation Research Part B"},{"key":"2817_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem. Theoretical Computer Science, 10, 267\u2013283.","journal-title":"Theoretical Computer Science"},{"key":"2817_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01580752","volume":"48","author":"P Harker","year":"1988","unstructured":"Harker, P. (1988). Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Mathematical Programming, 48, 29\u201359.","journal-title":"Mathematical Programming"},{"key":"2817_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0191-2615(88)90004-5","volume":"22","author":"HS Mahmassani","year":"1988","unstructured":"Mahmassani, H. S., & Mouskos, K. C. (1988). Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks. Transportation Research Part B, 22, 275\u2013290.","journal-title":"Transportation Research Part B"},{"key":"2817_CR25","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/trsc.1030.0039","volume":"38","author":"P Marcotte","year":"2004","unstructured":"Marcotte, P., & Wynter, L. (2004). A new look at the multiclass network equilibrium problem. Transportation Science, 38, 282\u2013292.","journal-title":"Transportation Science"},{"key":"2817_CR26","series-title":"International series in operations research & management science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0257-9","volume-title":"Computational techniques of the simplex method","author":"I Maros","year":"2003","unstructured":"Maros, I. (2003). Computational techniques of the simplex method (Vol. 61)., International series in operations research & management science Boston, MA: Kluwer Academic Publishers."},{"key":"2817_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on discrete geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J. (2002). Lectures on discrete geometry. Berlin: Springer."},{"key":"2817_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0167-6377(89)90014-X","volume":"8","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N., & Chandrasekaran, R. (1989). On the \n                    \n                      \n                    \n                    $$\\varepsilon $$\n                    \n                      \n                        \u03b5\n                      \n                    \n                  -perturbation method for avoiding degeneracy. Operations Research Letters, 8, 305\u2013308.","journal-title":"Operations Research Letters"},{"key":"2817_CR29","doi-asserted-by":"crossref","unstructured":"Meunier, F., & Pradeau, T. (2013). A Lemke-like algorithm for the multiclass network equilibrium problem. In Proceedings of the 9th conference on web and internet economics (WINE) (pp. 363\u2013376). Springer.","DOI":"10.1007\/978-3-642-45046-4_30"},{"key":"2817_CR30","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I. (1996). Congestion games with player-specific payoff functions. Games Economic Behavior, 13, 111\u2013124.","journal-title":"Games Economic Behavior"},{"key":"2817_CR31","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1287\/moor.25.3.349.12220","volume":"25","author":"I Milchtaich","year":"2000","unstructured":"Milchtaich, I. (2000). Generic uniqueness of equilibrium in large crowding games. Mathematics of Operations Research, 25, 349\u2013364.","journal-title":"Mathematics of Operations Research"},{"key":"2817_CR32","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11944874_9","volume":"4286","author":"I Milchtaich","year":"2006","unstructured":"Milchtaich, I. (2006). The equilibrium existence problem in finite network congestion games. Lecture Notes in Computer Science, 4286, 87\u201398.","journal-title":"Lecture Notes in Computer Science"},{"key":"2817_CR33","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"JF Nash","year":"1951","unstructured":"Nash, J. F. (1951). Non-cooperative games. Annals of Mathematics, 54, 286\u2013295.","journal-title":"Annals of Mathematics"},{"key":"2817_CR34","unstructured":"Ortuzar, J. D., & Willumsen, L. G. (2001). Modelling transport (3rd ed.). Wiley."},{"key":"2817_CR35","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. (1994). On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48, 498\u2013532.","journal-title":"Journal of Computer and System Sciences"},{"key":"2817_CR36","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01211424","volume":"2","author":"KP Rath","year":"1992","unstructured":"Rath, K. P. (1992). A direct proof of the existence of pure strategy equilibria in games with a continuum of players. Economic Theory, 2, 427\u2013433.","journal-title":"Economic Theory"},{"key":"2817_CR37","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2, 65\u201367.","journal-title":"International Journal of Game Theory"},{"key":"2817_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0558-3","volume":"142","author":"DA Schiro","year":"2013","unstructured":"Schiro, D. A., Pang, J. S., & Shanbhag, U. V. (2013). On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke\u2019s method. Mathematical Programming, 142, 1\u201346.","journal-title":"Mathematical Programming"},{"key":"2817_CR39","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01014905","volume":"7","author":"D Schmeidler","year":"1970","unstructured":"Schmeidler, D. (1970). Equilibrium points on nonatomic games. Journal of Statistical Physics, 7, 295\u2013300.","journal-title":"Journal of Statistical Physics"},{"key":"2817_CR40","volume-title":"Combinatorial optimization, polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A. (2003). Combinatorial optimization, polyhedra and efficiency. Berlin: Springer."},{"key":"2817_CR41","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0191-2615(81)90029-1","volume":"15","author":"MJ Smith","year":"1979","unstructured":"Smith, M. J. (1979). The existence, uniqueness, and stability of traffic equilibria. Transportation Research Part B, 15, 443\u2013451.","journal-title":"Transportation Research Part B"},{"key":"2817_CR42","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"2","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J. G. (1952). Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 2, 325\u2013378.","journal-title":"Proceedings of the Institution of Civil Engineers"},{"key":"2817_CR43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual interior-point methods","author":"S Wright","year":"1997","unstructured":"Wright, S. (1997). Primal-dual interior-point methods. Philadelphia: SIAM Publication."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2817-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2817-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T00:26:47Z","timestamp":1553041607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2817-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,20]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2817"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2817-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,20]]},"assertion":[{"value":"20 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}