Journal
OPERATIONS RESEARCH LETTERS
Volume 36, Issue 2, Pages 141-149Publisher
ELSEVIER
DOI: 10.1016/j.orl.2007.03.005
Keywords
pricing; networks; bilevel programming; valid inequalities; branch-and-cut
Categories
Ask authors/readers for more resources
Consider the problem of maximizing the toll revenue collected on a multi-commodity transportation network. This fits a bilevel framework where a leader sets tolls, while users respond by selecting cheapest paths to their destination. We propose novel formulations of the problem, together with valid inequalities yielding improved algorithms. (C) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available