16596 search results - page 191 / 3320 » Generalized Assignment Problems |
158
click to vote
WINE
2010
Springer
15 years 11 days ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
139
Voted
AAAI
2011
14 years 2 months ago
2011
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
115
click to vote
PERCOM
2006
ACM
16 years 2 months ago
2006
ACM
Consider a placement of heterogeneous, wireless sensors that can vary the transmission range by increasing or decreasing power. The problem of determining an optimal assignment of ...
117
click to vote
HAIS
2009
Springer
15 years 7 months ago
2009
Springer
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
125
click to vote
ENDM
2006
15 years 2 months ago
2006
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...