{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:47:59Z","timestamp":1743144479897,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489949"},{"type":"electronic","value":"9783662489956"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48995-6_7","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T18:37:29Z","timestamp":1449599849000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["New Complexity Results and Algorithms for the Minimum Tollbooth Problem"],"prefix":"10.1007","author":[{"given":"Soumya","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanasis","family":"Lianeas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evdokia","family":"Nikolova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10898-010-9527-7","volume":"48","author":"L Bai","year":"2010","unstructured":"Bai, L., Hearn, D.W., Lawphongpanich, S.: A heuristic method for the minimum toll booth problem. J. Global Optim. 48(4), 533\u2013548 (2010)","journal-title":"J. Global Optim."},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","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."},{"issue":"2","key":"7_CR3","first-page":"33","volume":"11","author":"L Bai","year":"2008","unstructured":"Bai, L., Stamps, M.T., Harwood, R.C., Kollmann, C.J., Seminary, C.: An evolutionary method for the minimum toll booth problem: The methodology. Acad. Info. Manage. Sci. J. 11(2), 33 (2008)","journal-title":"Acad. Info. Manage. Sci. J."},{"issue":"1","key":"7_CR4","first-page":"4","volume":"7","author":"G Baier","year":"2010","unstructured":"Baier, G., Erlebach, T., Hall, A., K\u00f6hler, E., Kolman, P., Pangr\u00e1c, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. ACM Trans. Algorithms (TALG) 7(1), 4 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Basu, S., Lianeas, T., Nikolova, E.: New complexity results and algorithms for the minimum tollbooth problem (2015). http:\/\/arxiv.org\/abs\/1509.07260","DOI":"10.1007\/978-3-662-48995-6_7"},{"key":"7_CR6","volume-title":"Studies in the Economics of Transportation","author":"M Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C., Weinstein, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"7_CR7","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-59179-2_4","volume-title":"Network Optimization","author":"P Bergendorff","year":"1997","unstructured":"Bergendorff, P., Hearn, D.W., Ramana, M.V.: Congestion toll pricing of traffic networks. In: Pardalos, P.M., Heam, D.W., Hager, W.W. (eds.) Network Optimization. LNEMS, vol. 450, pp. 51\u201371. Springer, Heidelberg (1997)"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s11590-010-0226-6","volume":"4","author":"LS Buriol","year":"2010","unstructured":"Buriol, L.S., Hirsch, M.J., Pardalos, P.M., Querido, T., Resende, M.G., Ritt, M.: A biased random-key genetic algorithm for road congestion minimization. Optim. Lett. 4(4), 619\u2013633 (2010)","journal-title":"Optim. Lett."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439\u2013485 (2005)","journal-title":"Ann. Math."},{"key":"7_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 29. W.H. Freeman (2002)"},{"key":"7_CR11","unstructured":"Harks, T., Sch\u00e4fer, G., Sieg, M.: Computing flow-inducing network tolls. Technical report, 36\u20132008, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Germany (2008)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Hearn, D.W., Ramana, M.V.: Solving congestion toll pricing models. In: Marcotte, P., Nguyen, S., (eds.) Equilibrium and Advanced Transportation Modelling. Centre for Research on Transportation, pp. 109\u2013124. Springer, New York (1998)","DOI":"10.1007\/978-1-4615-5757-9_6"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-92185-1_35","volume-title":"Internet and Network Economics","author":"Martin Hoefer","year":"2008","unstructured":"Hoefer, Martin, Olbrich, Lars, Skopalik, Alexander: Taxing subnetworks. In: Papadimitriou, Christos, Zhang, Shuzhong (eds.) WINE 2008. LNCS, vol. 5385, pp. 286\u2013294. Springer, Heidelberg (2008)"},{"key":"7_CR14","volume-title":"Selfish Routing and the Price of Anarchy","author":"T Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"7_CR15","unstructured":"Stefanello, F., Buriol, L., Hirsch, M., Pardalos, P., Querido, T., Resende, M., Ritt, M.: On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res., 1\u201321 (2013)"},{"key":"7_CR16","unstructured":"The Centre for Economics and Business Research: The future economic and environmental costs of gridlock in 2030. Technical report. INRIX, Inc. (2014)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 1\u201312. ACM (1979)","DOI":"10.1145\/800135.804393"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Road Paper. Some Theoretical Aspects of Road Traffic Research. In: ICE Proceedings: Engineering Divisions, vol. 1, pp. 325\u2013362. Thomas Telford (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48995-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T09:11:38Z","timestamp":1703754698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48995-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489949","9783662489956"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48995-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}