{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:37:39Z","timestamp":1768095459161,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10898-015-0396-y","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T03:17:01Z","timestamp":1450667821000},"page":"325-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A modified active set algorithm for transportation discrete network design bi-level problem"],"prefix":"10.1007","volume":"67","author":[{"given":"Ximing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"396_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Tech. rep., DTIC Document (1988)","DOI":"10.21236\/ADA594171"},{"key":"396_CR2","unstructured":"Beckmann, M., McGuire, C., Winsten, C.B.: Studies in the economics of transportation. Tech. rep. (1956)"},{"key":"396_CR3","unstructured":"Bertsekas, D.P.: Nonlinear programming, 2nd edn. Athena Scientific, Belmont (1999)"},{"key":"396_CR4","unstructured":"CPLEX, I.I.: V12. 1: Users manual for CPLEX. Int. Bus. Mach. Corp. 46(53), 157 (2009)"},{"issue":"1","key":"396_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"396_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: Conopt a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1\u20132","key":"396_CR7","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. Nav. Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"issue":"1","key":"396_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.41.1.179","volume":"41","author":"TL Friesz","year":"1993","unstructured":"Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., Wie, B.: A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1), 179\u2013191 (1993)","journal-title":"Oper. Res."},{"issue":"2","key":"396_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","volume":"18","author":"M Fukushima","year":"1984","unstructured":"Fukushima, M.: A modified frank-wolfe algorithm for solving the traffic assignment problem. Transp. Res. Part B Methodol. 18(2), 169\u2013177 (1984)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"4","key":"396_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0191-2615(98)00024-1","volume":"33","author":"T Larsson","year":"1999","unstructured":"Larsson, T., Patriksson, M.: Side constrained traffic equilibrium models analysis, computation and applications. Transp. Res. Part B Methodol. 33(4), 233\u2013264 (1999)","journal-title":"Transp. Res. Part B Methodol."},{"key":"396_CR11","unstructured":"Rosenthal, R.E.: Gams\u2014a user\u2019s guide. GAMS Development Corporation, Washington, DC (2004)"},{"issue":"3","key":"396_CR12","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.1080.0607","volume":"57","author":"O Seref","year":"2009","unstructured":"Seref, O., Ahuja, R.K., Orlin, J.B.: Incremental network optimization: theory and algorithms. Oper. Res. 57(3), 586\u2013594 (2009)","journal-title":"Oper. Res."},{"key":"396_CR13","unstructured":"Sheffi, Y.: Urban transportation networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Inc., Englewood Cliffs (1984)"},{"key":"396_CR14","volume-title":"Dijkstra\u2019s Algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"S Skiena","year":"1990","unstructured":"Skiena, S.: Dijkstra\u2019s Algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading (1990)"},{"key":"396_CR15","unstructured":"Yin, Y., Lawphongpanich, S.: A robust approach to continuous network designs with demand uncertainty. In: Transportation and Traffic Theory 2007. Papers Selected for Presentation at ISTTT17 (2007)"},{"key":"396_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, L., Lawphongpanich, S., Yin, Y.: An active-set algorithm for discrete network design problems. In: Lam, W.H.K., Wong, H., Lo, H.K. (eds.) Transportation and Traffic Theory 2009: Golden Jubilee, pp. 283\u2013300. Springer, Berlin (2009)","DOI":"10.1007\/978-1-4419-0820-9_14"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0396-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0396-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0396-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0396-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T15:41:17Z","timestamp":1567438877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0396-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["396"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0396-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}