{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:47:55Z","timestamp":1759837675088,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009573","name":"Universidad Nacional de Rosario","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009573","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002923","name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","doi-asserted-by":"publisher","award":["PIP 2012-2014 N 0286"],"award-info":[{"award-number":["PIP 2012-2014 N 0286"]}],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01189-5","type":"journal-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T12:03:44Z","timestamp":1594209824000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The demand adjustment problem via inexact restoration method"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7898-1991","authenticated-orcid":false,"given":"Jorgelina","family":"Walpen","sequence":"first","affiliation":[]},{"given":"Pablo A.","family":"Lotito","sequence":"additional","affiliation":[]},{"given":"Elina M.","family":"Mancinelli","sequence":"additional","affiliation":[]},{"given":"Lisandro","family":"Parente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"1189_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0191-2615(79)90004-3","volume":"13","author":"M Abdulaal","year":"1979","unstructured":"Abdulaal M, LeBlanc LJ (1979) Continuous equilibrium network design models. Transp Res B 13:19\u201332","journal-title":"Transp Res B"},{"key":"1189_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-007-9147-4","volume":"43","author":"R Andreani","year":"2009","unstructured":"Andreani R, Castro SLC, Chela JL, Friedlander A, Santos SA (2009) An inexact-restoration method for nonlinear bilevel programming problems. Comput Optim Appl 43:307\u2013328","journal-title":"Comput Optim Appl"},{"issue":"3","key":"1189_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/moor.2017.0879","volume":"43","author":"R Andreani","year":"2018","unstructured":"Andreani R, Mart\u00ednez JM, Ramos A, Silva PJS (2018) Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math Oper Res 43(3):693\u2013717","journal-title":"Math Oper Res"},{"key":"1189_CR4","doi-asserted-by":"crossref","unstructured":"Chen Y, Florian M (1996) O-d demand adjustment problem with congestion: Part i. model analysis and optimality conditions. Adv Methods Transp Anal 1\u201322","DOI":"10.1007\/978-3-642-85256-5_1"},{"key":"1189_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ejor.2003.08.004","volume":"155","author":"E Codina","year":"2004","unstructured":"Codina E, Barcel\u00f3 J (2004) Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. Eur J Oper Res 155:535\u2013557","journal-title":"Eur J Oper Res"},{"key":"1189_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10479-006-0007-x","volume":"144","author":"E Codina","year":"2006","unstructured":"Codina E, Montero L (2006) Approximation of the steepest descent direction for the o-d matrix adjustment problem. Ann Oper Res 144:329\u2013362","journal-title":"Ann Oper Res"},{"key":"1189_CR7","unstructured":"Gomes F AM, Friedlander A (2011) Solution of a truss topology bilevel programming problem by a means of an inexact restoration method. Comput Appl Math 30.1"},{"issue":"1","key":"1189_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10589-010-9341-7","volume":"51","author":"AF Izmailov","year":"2012","unstructured":"Izmailov AF, Pogosyan AL, Solodov MV (2012) Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints. Comput Optim Appl 51(1):199\u2013221","journal-title":"Comput Optim Appl"},{"key":"1189_CR9","unstructured":"Lotito PA, Mancinelli EM, Quadrat JP, Wynter L (2003) The traffic assignment toolboxes of scilab. INRIA - Rocquencourt"},{"key":"1189_CR10","unstructured":"Lotito PA, Parente LA (2014) Estimaci\u00f3n de Matrices O-D Mediante T\u00e9cnicas de elevaci\u00f3n y M\u00e9todos de Newton Semisuaves. Mec\u00e1nica Computacional, 33:2457-2467, AMCA"},{"key":"1189_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.trb.2007.09.005","volume":"42","author":"JT Lundgren","year":"2008","unstructured":"Lundgren JT, Peterson A (2008) A heuristic for the bilevel origin-destination-matrix estimation problem. Transp Res B 42:339\u2013354","journal-title":"Transp Res B"},{"key":"1189_CR12","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, JM, Pilotta EA (2005) Inexact-restoration methods for nonlinear programming: Advances and perspectives. In L.\u00a0Qi, K. Teo and X. Yang editors, Optimization and Control with Applications, pages 271\u2013292, Springer","DOI":"10.1007\/0-387-24255-4_12"},{"issue":"2","key":"1189_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1023\/A:1022626332710","volume":"96","author":"JM Mart\u00ednez","year":"1998","unstructured":"Mart\u00ednez JM (1998) Two-phase model algorithm with global convergence for nonlinear programming. J Optim Theory Appl 96(2):397\u2013436","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"1189_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1017567113614","volume":"111","author":"JM Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez JM (2001) Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J Optim Theory Appl 111(1):39\u201358","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"1189_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1004632923654","volume":"104","author":"JM Mart\u00ednez","year":"2000","unstructured":"Mart\u00ednez JM, Pilotta EA (2000) Inexact-restoration algorithm for constrained optimization. J Optim Theory Appl 104(1):135\u2013163","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"1189_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1024791525441","volume":"118","author":"JM Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez JM, Svaiter BF (2003) A practical optimality condition without constraint qualifications for nonlinear programming. J Optim Theory Appl 118(1):117\u2013133","journal-title":"J Optim Theory Appl"},{"key":"1189_CR17","unstructured":"Nguyen S (1977) Estimating an o-d matrix from network data: A network equilibrium approach. Publication 87, Centre de recherche sur les transports (CRT), Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada"},{"key":"1189_CR18","volume-title":"The Traffic Assignment Problem. Models and Methods.","author":"M Patriksson","year":"1994","unstructured":"Patriksson M (1994) The Traffic Assignment Problem. Models and Methods. Topics in Transportation VSP, The Netherlands"},{"key":"1189_CR19","unstructured":"Spiess H (1990) A descent based approach for the od matrix adjustment problem. Publication 693, Centre de recherche sur les transports (CRT), Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada"},{"key":"1189_CR20","volume-title":"Optimization of transport networks","author":"PA Steenbrink","year":"1976","unstructured":"Steenbrink PA (1976) Optimization of transport networks. Wiley, Hoboken"},{"key":"1189_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-010-0345-y","volume":"131","author":"O Stein","year":"2012","unstructured":"Stein O (2012) Lifting mathematical programs with complementarity constraints. Math Program 131:71\u201394","journal-title":"Math Program"},{"key":"1189_CR22","first-page":"540","volume":"40","author":"C Suwansirikul","year":"1987","unstructured":"Suwansirikul C, Friesz TL, Tobin RL (1987) Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problem. Transp Sci 40:540\u2013542","journal-title":"Transp Sci"},{"key":"1189_CR23","unstructured":"Walpen J (2015) Sobre la resoluci\u00f3n del problema de ajustar la matriz origen destino en una red de tr\u00e1fico vehicular congestionada. Tesis de Doctorado en Matem\u00e1tica - FCEIA - Universidad Nacional de Rosario,Director: Pablo A. Lotito. Codirectora: Elina M. Mancinelli"},{"key":"1189_CR24","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2014.11.009","volume":"242","author":"J Walpen","year":"2015","unstructured":"Walpen J, Mancinelli EM, Lotito PA (2015) A heuristic for the od matrix adjustment problem in a congested transport network. Eur J Oper Res 242:807\u2013819","journal-title":"Eur J Oper Res"},{"key":"1189_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0191-2615(92)90008-K","volume":"26B","author":"H Yang","year":"1992","unstructured":"Yang H, Sasaki T, Iida Y, Asakura Y (1992) Estimation of origin-destination matrices from link traffic counts on congested networks. Transp Res 26B:417\u2013434","journal-title":"Transp Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01189-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01189-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01189-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T23:33:18Z","timestamp":1625700798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01189-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1189"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01189-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"30 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"204"}}