|
Search the dblp DataBase
Jan-Kees C. W. van Ommeren:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Adriana Felicia Bumb, Jan-Kees C. W. van Ommeren
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands. [Citation Graph (0, 0)][DBLP] AAIM, 2005, pp:330-339 [Conf]
- Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. [Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:207-219 [Conf]
- Jan-Kees C. W. van Ommeren, Adriana Felicia Bumb, Andrei Sleptchenko
Locating repair shops in a stochastic environment. [Citation Graph (0, 0)][DBLP] Computers & OR, 2006, v:33, n:, pp:1575-1594 [Journal]
- Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
An approximation algorithm for a facility location problem with stochastic demands and inventories. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:3, pp:257-263 [Journal]
- Pieter-Tjerk de Boer, Victor F. Nicola, Jan-Kees C. W. van Ommeren
The Remaining Service Time upon Reaching a High Level in M/G/1 Queues. [Citation Graph (0, 0)][DBLP] Queueing Syst., 2001, v:39, n:1, pp:55-78 [Journal]
- Jan-Kees C. W. van Ommeren
The Discrete-Time Single-Server Queue. [Citation Graph (0, 0)][DBLP] Queueing Syst., 1991, v:8, n:3, pp:279-294 [Journal]
- Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
Approximation algorithms for facility location problems with a special class of subadditive cost functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:3, pp:289-300 [Journal]
- Roland de Haan, Richard J. Boucherie, Jan-Kees C. W
The Impact of Interference on Optimal Multi-path Routing in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP] International Teletraffic Congress, 2007, pp:803-815 [Conf]
A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks. [Citation Graph (, )][DBLP]
A new approximation algorithm for the multilevel facility location problem. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|