A Polyhedral Study of the Network Pricing Problem with Connected Toll Arcs

We consider the problem of setting revenue-maximizing tolls on a subset of arcs of a transportation network, assuming that the users of the network are assigned to shortest paths with respect to the sum of tolls and initial costs. Our main results are concerned with a polyhedral study of the problem, i.e., the design of valid inequalities and facets for this pricing problem and some of its variants. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(3), 234-246 2010