7 search results - page 1 / 2 » Valid inequalities and branch-and-cut for the clique pricing... |
DISOPT
2011
12 years 8 months ago
2011
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
EOR
2000
13 years 4 months ago
2000
ORL
2008
13 years 4 months ago
2008
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 res...
ATMOS
2010
13 years 3 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
IOR
2011
12 years 12 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...