7 search results - page 1 / 2 » Valid inequalities and branch-and-cut for the clique pricing... |
131
click to vote
DISOPT
2011
14 years 4 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...
96
Voted
EOR
2000
15 years 11 days ago
2000
95
Voted
ORL
2008
15 years 15 days 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...
114
Voted
ATMOS
2010
14 years 11 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...
132
click to vote
IOR
2011
14 years 7 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 ...