A Catalog of Formulations for the Network Pricing Problem

Published Online:https://doi.org/10.1287/ijoc.2022.1198

References

  • Barthélemy M (2011) Spatial networks. Phys. Rep. 499(1):1–101.CrossrefGoogle Scholar
  • Bouhtou M, Hoesel S, Kraaij A, Lutton JL (2007) Tariff optimization in networks. INFORMS J. Comput. 19(3):458–469.LinkGoogle Scholar
  • Brotcorne L, Cirinei F, Marcotte P, Savard G (2011) An exact algorithm for the network pricing problem. Discrete Optim. 8(2):246–258.CrossrefGoogle Scholar
  • Brotcorne L, Cirinei F, Marcotte P, Savard G (2012) A tabu search algorithm for the network pricing problem. Comput. Oper. Res. 39(11):2603–2611.CrossrefGoogle Scholar
  • Brotcorne L, Labbé M, Marcotte P, Savard G (2000) A bilevel model and solution algorithm for a freight tariff-setting problem. Transportation Sci. 34(3):289–302.LinkGoogle Scholar
  • Brotcorne L, Labbé M, Marcotte P, Savard G (2001) A bilevel model for toll optimization on a multicommodity transportation network. Transportation Sci. 35(4):345–358.LinkGoogle Scholar
  • Brotcorne L, Labbé M, Marcotte P, Savard G (2008) Joint design and pricing on a network. Oper. Res. 56(5):1104–1115.LinkGoogle Scholar
  • Dewez S, Labbé M, Marcotte P, Savard G (2008) New formulations and valid inequalities for a bilevel pricing problem. Oper. Res. Lett. 36(2):141–149.CrossrefGoogle Scholar
  • Didi-Biha M, Marcotte P, Savard G (2006) Path-based formulations of a bilevel toll setting problem. Dempe S, Kalashnikov V, eds. Optimization with Multivalued Mappings (Springer, Boston), 29–50.CrossrefGoogle Scholar
  • Fischetti M, Ljubić I, Monaci M, Sinnl M (2017) A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6):1615–1637.LinkGoogle Scholar
  • Gilbert F, Marcotte P, Savard G (2015) A numerical study of the logit network pricing problem. Transportation Sci. 49(3):706–719.LinkGoogle Scholar
  • Heilporn G, Labbé M, Marcotte P, Savard G (2006) New formulations and valid inequalities for the toll setting problem. IFAC Proc. Volumes 39(3):431–436.Google Scholar
  • Heilporn G, Labbé M, Marcotte P, Savard G (2010) A polyhedral study of the network pricing problem with connected toll arcs. Networks 55(3):234–246.CrossrefGoogle Scholar
  • Labbé M, Marcotte P, Savard G (1998) A bilevel model of taxation and its application to optimal highway pricing. Management Sci. 44(12-part-1):1608–1622.LinkGoogle Scholar
  • Lawler EL (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Sci. 18(7):401–405.LinkGoogle Scholar
  • Roch S, Savard G, Marcotte P (2005) An approximation algorithm for Stackelberg network pricing. Networks 46(1):57–67.CrossrefGoogle Scholar
  • Tahernejad S, Ralphs TK, DeNegre ST (2020) A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Programming Comput. (12):529–568.CrossrefGoogle Scholar
  • van Hoesel C, van der Kraaij AF, Mannino C, Oriolo G, Bouhtou M (2003) Polynomial cases of the tarification problem. Working paper, METEOR, Maastricht University School of Business and Economics.Google Scholar
  • Wolsey LA, Nemhauser GL (1999) Integer and Combinatorial Optimization (Wiley, New York).Google Scholar
  • Yen JY (1971) Finding the K shortest loopless paths in a network. Management Sci. 17(11):712–716.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.