#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Given a graph G = (N, E), N representing the set of nodes associated with Normally distributed random profits and E representing the set of edges with associated travel times, we define the Orienteering Problem with Stochastic Profits (OPSP) as the problem of finding a tour that visits a subset of N within a prespecified time limit and maximizes the… (More)

- M. Selim Akturk, Taylan Ilhan
- Computers & OR
- 2011

- Taylan Ilhan, Seyed M. R. Iravani, Mark S. Daskin
- Operations Research
- 2011

Given a set of items with associated deterministic weights and random rewards, the Adaptive Stochastic Knapsack Problem (Adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation… (More)

- ‹
- 1
- ›