{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T19:45:09Z","timestamp":1704311109882},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1016\/j.disopt.2010.09.003","type":"journal-article","created":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T11:27:03Z","timestamp":1289561223000},"page":"246-258","source":"Crossref","is-referenced-by-count":22,"title":["An exact algorithm for the network pricing problem"],"prefix":"10.1016","volume":"8","author":[{"given":"L.","family":"Brotcorne","sequence":"first","affiliation":[]},{"given":"F.","family":"Cirinei","sequence":"additional","affiliation":[]},{"given":"P.","family":"Marcotte","sequence":"additional","affiliation":[]},{"given":"G.","family":"Savard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2010.09.003_br000005","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1287\/mnsc.44.12.1608","article-title":"A bilevel model of taxation and its applications to optimal highway pricing","volume":"44","author":"Labb\u00e9","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/j.disopt.2010.09.003_br000010","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1287\/mnsc.39.2.160","article-title":"Heuristics for pricing and positioning a product-line using conjoint and cost data","volume":"39","author":"Dobson","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/j.disopt.2010.09.003_br000015","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.20074","article-title":"An approximation algorithm for Stackelberg network pricing","volume":"46","author":"Roch","year":"2005","journal-title":"Networks"},{"key":"10.1016\/j.disopt.2010.09.003_br000020","series-title":"Approximation and Online Algorithms","first-page":"140","article-title":"Pricing network edges to cross a river","volume":"vol. 3351","author":"Grigoriev","year":"2005"},{"key":"10.1016\/j.disopt.2010.09.003_br000025","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1287\/trsc.34.3.289.12299","article-title":"A bilevel model and solution algorithm for a freight tariff setting problem","volume":"34","author":"Brotcorne","year":"2000","journal-title":"Transportation Science"},{"key":"10.1016\/j.disopt.2010.09.003_br000030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.35.4.345.10433","article-title":"A bilevel model for toll optimization on a multi-commodity transportation network","volume":"35","author":"Brotcorne","year":"2001","journal-title":"Transportation Science"},{"key":"10.1016\/j.disopt.2010.09.003_br000035","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.orl.2007.03.005","article-title":"New formulations and valid inequalities for a bilevel pricing problem","volume":"36","author":"Dewez","year":"2008","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.disopt.2010.09.003_br000040","unstructured":"M. Bouhtou, S. van Hoesel, A. van der Kraaij, J.L. Lutton, Optimization in networks, Research Memorandum 041, METEOR, Maastricht Research School of Economics of Technology and Organization, 2003."},{"key":"10.1016\/j.disopt.2010.09.003_br000045","unstructured":"G. Heilporn, Network pricing problems: complexity, polyhedral study and solution approaches, Ph.D. Thesis, Universit\u00e9 Libre de Bruxelles, 2008."},{"key":"10.1016\/j.disopt.2010.09.003_br000050","series-title":"Optimization with Multivalued Mappings Theory: Theory, Applications and Algorithms","first-page":"29","article-title":"Path-based formulations of a bilevel toll setting problem","volume":"vol. 2","author":"Didi Biha","year":"2006"},{"key":"10.1016\/j.disopt.2010.09.003_br000055","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the K-shortest loopless paths in a network","volume":"17","author":"Yen","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/j.disopt.2010.09.003_br000060","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1142\/9789814355858_0006","article-title":"Voronoi diagrams and Delaunay triangularisation","author":"Fortune","year":"1992","journal-title":"Computing in Euclidean Geometry"},{"key":"10.1016\/j.disopt.2010.09.003_br000065","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1287\/opre.1080.0617","article-title":"Joint design and pricing on a network","volume":"56","author":"Brotcorne","year":"2008","journal-title":"Operation Research"},{"key":"10.1016\/j.disopt.2010.09.003_br000070","unstructured":"R. Tarjan, Shortest paths, Technical Report, AT&T Bell Laboratories, Murray Hill, NJ, 1981."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528610000617?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528610000617?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T22:26:58Z","timestamp":1544135218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528610000617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["S1572528610000617"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2010.09.003","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}