{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:06:04Z","timestamp":1764936364461,"version":"3.30.2"},"reference-count":33,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2004,7,27]],"date-time":"2004-07-27T00:00:00Z","timestamp":1090886400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The objective of the minimum toll revenue (MINREV) problem is to find tolls that simultaneously cause users to use the transportation network efficiently and minimize the total toll revenues that must be collected. This article investigates the Dantzig\u2010Wolfe (DW) decomposition as an approach for solving the MINREV problem and establishes its relationships with a cutting plane algorithm and other proposed approaches. The article also identifies the variant of DW decomposition most suitable for implementation. Numerical experiments with real transportation networks suggest that DW decomposition is robust and should be used when the problems are too large for standard linear programming software. Although transportation planning is the application emphasized in this article, it should be noted that the MINREV problem also has applications in telecommunication network design and control. \u00a9 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 142\u2013150 2004<\/jats:p>","DOI":"10.1002\/net.20024","type":"journal-article","created":{"date-parts":[[2004,7,27]],"date-time":"2004-07-27T19:46:43Z","timestamp":1090957603000},"page":"142-150","source":"Crossref","is-referenced-by-count":21,"title":["Decomposition techniques for the minimum toll revenue problem"],"prefix":"10.1002","volume":"44","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":"311","published-online":{"date-parts":[[2004,7,27]]},"reference":[{"volume-title":"Network flows: Theory, algorithm and applications","year":"1993","author":"Ahuja R.K.","key":"e_1_2_1_2_2"},{"key":"e_1_2_1_3_2","first-page":"446","article-title":"The economics of traffic congestion","volume":"82","author":"Arnott R.","year":"1994","journal-title":"Am Sci"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.36.4.398.549"},{"volume-title":"Linear programming and network flows","year":"1990","author":"Bazaraa M.S.","key":"e_1_2_1_5_2"},{"key":"e_1_2_1_6_2","unstructured":"D.Beinstock Potential function methods for approximately solving linear programming problems: Theory and practice CORE Lecture Series 2001."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.1.3.17780"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"R.Cole Y.Dodis andT.Roughgarden Pricing network edges for heterogeneous selfish users STOC'03 June 9\u201311 San Diego CA 2003.","DOI":"10.1145\/780542.780618"},{"key":"e_1_2_1_9_2","unstructured":"CPLEX 1996 CPLEX Optimization Inc. Incline Village NV"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(98)00026-5"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00046-6"},{"volume-title":"General Algebraic Modeling System","year":"1995","author":"GAMS","key":"e_1_2_1_12_2"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/0-306-48058-1_11","volume-title":"Handbook of transportation science","author":"Florian M.","year":"2003"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170307"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(95)00013-4"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121181"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5757-9_6"},{"volume-title":"Current trends in transportation and network analysis papers in honor of Michael Florian","year":"2001","author":"Hearn D.","key":"e_1_2_1_18_2"},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","unstructured":"D.Hearn M.Yildirim M.Ramana andL.Bai Computational methods for congestion toll pricing models IEEE Intell Transport Syst Proc 2001 pp.257\u2013262.","DOI":"10.1109\/ITSC.2001.948665"},{"key":"e_1_2_1_20_2","article-title":"Mathematical modeling and control of internet congestion","volume":"33","author":"Johari R.","year":"2000","journal-title":"SIAM News"},{"key":"e_1_2_1_21_2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","article-title":"Rate control in communication networks: Shadow prices, proportional fairness, and stability","volume":"49","author":"Kelly F.P.","year":"1998","journal-title":"J Operat Res Soc"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.12.1608"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5757-9_7"},{"volume-title":"An augmented lagrangian algorithm for large scale multicommodity routing","year":"2000","author":"Larsson T.","key":"e_1_2_1_24_2"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(75)90030-1"},{"journal-title":"Mathematical Programming B","article-title":"On the second\u2010best toll pricing problem","author":"Lawphongpanich S.","key":"e_1_2_1_26_2"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(98)00025-3"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658"},{"volume-title":"Decision and control in management sciences: Essays in honor of Alain Haurie","year":"2001","author":"Marcotte P.","key":"e_1_2_1_29_2"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098164"},{"volume-title":"Road charging options for London: A technical assessment","year":"2000","author":"The Review of Charging Options for London (ROCOL) Working Group","key":"e_1_2_1_31_2"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(01)00025-X"},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-0462(00)00064-8"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1006\/juec.1996.0033"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T01:34:51Z","timestamp":1734485691000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1002\/net.20024"],"URL":"https:\/\/doi.org\/10.1002\/net.20024","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"type":"print","value":"0028-3045"},{"type":"electronic","value":"1097-0037"}],"subject":[],"published":{"date-parts":[[2004,7,27]]}}}