We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel mathematical program where the upper level consists in a firm that raises revenues from tolls set on arcs of the network, while the lower level is represented by a group of users travelling on shortest… (More)
We consider a bilevel programming formulation of a freight tarii setting problem where the leader consists in one among a group of competing carriers and the follower is a shipper. At the upper level, the leader's revenue corresponds to the total tariis levied, while the shipper minimizes its transportation cost, given the tarii schedule set by the leader.… (More)
In order to optimize revenue, service firms must integrate within their pricing policies the rational reaction of customers to their price schedules. In the airline or telecommunication industry, this process is all the more complex due to interactions resulting from the structure of the supply network. In this paper we consider a streamlined version of… (More)
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening. 2002 Elsevier Science Ltd. All rights reserved.