{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:08:45Z","timestamp":1764936525970},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10898-010-9527-7","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T09:32:25Z","timestamp":1265275945000},"page":"533-548","source":"Crossref","is-referenced-by-count":11,"title":["A heuristic method for the minimum toll booth problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Lihui","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald W.","family":"Hearn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siriphong","family":"Lawphongpanich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"9527_CR1","volume-title":"Network Flows, Theory, Algorithm and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows, Theory, Algorithm and Applications. Prentice Hall, Upper Saddle River (1993)"},{"issue":"2","key":"9527_CR2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/net.20024","volume":"44","author":"L. Bai","year":"2004","unstructured":"Bai L., Hearn D.W., Lawphongpanich S.: Decomposition techniques for the minimum toll revenue problem. Networks 44(2), 142\u2013150 (2004)","journal-title":"Networks"},{"issue":"6","key":"9527_CR3","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1287\/opre.1090.0694","volume":"57","author":"L. Bai","year":"2009","unstructured":"Bai L., Rubin P.A.: Combinatorial benders cuts for the minimum tollbooth problem. Oper. Res. 57(6), 1510\u20131522 (2009)","journal-title":"Oper. Res."},{"key":"9527_CR4","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"Bazaraa M.S., Jarvis J.J., Sherali H.D.: Linear Programming and Network Flows. Wiley, Hoboken (1990)"},{"key":"9527_CR5","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann M., McGuire C., Winston C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"9527_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2003.10.037","volume":"126","author":"M.C. Costa","year":"2005","unstructured":"Costa M.C., L\u00e9tocart L., Roupin F.: Minimal multicut and maximal integer multiflow: a survey. Eur. J. Oper. Res. 126, 55\u201369 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9527_CR7","unstructured":"CPLEX: CPLEX Optimization Inc., Incline Village (1996)"},{"key":"9527_CR8","unstructured":"DeCorla-Souza, P.: Report to the transportation research board joint subcommittee on pricing. In: 82nd Annual Transportation Research Board Meeting, Washington (2005)"},{"key":"9527_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230170307","volume":"17","author":"M. Florian","year":"1987","unstructured":"Florian M., Gu\u00e9lat J., Spiess H.: An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem. Networks 17, 319\u2013339 (1987)","journal-title":"Networks"},{"key":"9527_CR10","first-page":"485","volume-title":"Handbooks in Operations Research and Management Science, vol. 8: Network Routing","author":"M. Florian","year":"1995","unstructured":"Florian M., Hearn D.W.: Network equilibrium models and algorithms. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Handbooks in Operations Research and Management Science, vol. 8: Network Routing, pp. 485\u2013550. North-Holland, New York (1995)"},{"key":"9527_CR11","unstructured":"GAMS: General Algebraic Modeling System. GAMS Development Corporation (1995)"},{"key":"9527_CR12","doi-asserted-by":"crossref","unstructured":"Garg, N., Vazirani, V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Proceedings for the 21st International Colloquium on Automata, Languages, and Programming, pp. 487\u2013498, Jerusalem (1994)","DOI":"10.1007\/3-540-58201-0_92"},{"key":"9527_CR13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","volume":"31","author":"D.W. Hearn","year":"1995","unstructured":"Hearn D.W., Lawphongpanich S., Ventura J.: Restricted simplicial decomposition: computation and xtensions. Math. Program. Study 31, 99\u2013118 (1995)","journal-title":"Math. Program. Study"},{"key":"9527_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-1-4615-5757-9_6","volume-title":"Equilibrium and Advanced Transportation Modeling","author":"D.W. Hearn","year":"1998","unstructured":"Hearn D.W., Ramana M.: Solving congestion toll pricing models. In: Marcotte, P., Nguyen, S. (eds) Equilibrium and Advanced Transportation Modeling, pp. 109\u2013124. Kluwer, Norwell (1998)"},{"issue":"4","key":"9527_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim D., Pardalos P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9527_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10898-005-1383-5","volume":"35","author":"S. Lawphongpanich","year":"2006","unstructured":"Lawphongpanich S.: Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation. J. Glob. Optim. 35, 121\u2013130 (2006)","journal-title":"J. Glob. Optim."},{"key":"9527_CR17","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":"9527_CR18","volume-title":"National Strategy to Reduce Congestion on America\u2019s Transportation Network","author":"N.Y. Mineta","year":"2006","unstructured":"Mineta N.Y.: National Strategy to Reduce Congestion on America\u2019s Transportation Network. U.S. Department of Transportation, Washington (2006)"},{"issue":"1","key":"9527_CR19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A. Nahapetyan","year":"2008","unstructured":"Nahapetyan A., Pardalos P.M.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39(1), 37\u201350 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9527_CR20","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou A.C.: The Economics of Welfare. MacMillan, New York (1920)"},{"key":"9527_CR21","unstructured":"Schrank, D., Lomax, T.: Urban Mobility Report 2007. Texas Transportation Institute, September 2007. http:\/\/mobility.tamu.edu . Accessed 1 May 2008"},{"key":"9527_CR22","unstructured":"Todd, J.: Duke Student Math Aims to Alleviate Tollbooth Lines. Duke University News and Communications, June 2005. http:\/\/www.dukenews.duke.edu\/2005\/06\/tollbooths.html . Accessed 1 May 2008"},{"key":"9527_CR23","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0191-2615(01)00025-X","volume":"36","author":"E. Verhoef","year":"2002","unstructured":"Verhoef E.: Second-best congestion pricing in general networks: heuristic algorithms for finding second-best optimal toll levels and toll points. Transp. Res. B. 36, 707\u2013729 (2002)","journal-title":"Transp. Res. B."},{"key":"9527_CR24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3141\/1857-10","volume":"1857","author":"H. Yang","year":"2003","unstructured":"Yang H., Zhang X.: Optimal toll design in second-best link-based congestion pricing. J. Transp. Res. Board Transp. Res. Rec. 1857, 85\u201392 (2003)","journal-title":"J. Transp. Res. Board Transp. Res. Rec."},{"key":"9527_CR25","first-page":"135","volume-title":"Current Trends in Transportation and Network Analysis: Papers in honor of Michael Florian","author":"M.B. Yildirim","year":"2002","unstructured":"Yildirim M.B., Hearn D.W.: A toll pricing framework for traffic assignment problems with elastic demand. In: Gendreau, M., Marcotte, P. (eds) Current Trends in Transportation and Network Analysis: Papers in honor of Michael Florian, pp. 135\u2013145. Kluwer, Norwell (2002)"},{"key":"9527_CR26","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.trb.2004.08.001","volume":"39","author":"M.B. Yildirim","year":"2005","unstructured":"Yildirim M.B., Hearn D.W.: A first best toll pricing framework for variable demand traffic assignment problems. Transp. Res. B. 39, 659\u2013678 (2005)","journal-title":"Transp. Res. B."},{"key":"9527_CR27","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.trb.2003.08.001","volume":"38","author":"X. Zhang","year":"2004","unstructured":"Zhang X., Yang H.: The optimal cordon-based network congestion pricing problem. Transp. Res. B. 38, 517\u2013537 (2004)","journal-title":"Transp. Res. B."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9527-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9527-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9527-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:55Z","timestamp":1559278735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9527-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9527"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9527-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}