Sciweavers

98 search results - page 17 / 20
» orl 2006
Sort
View
ORL
2002
92views more  ORL 2002»
14 years 10 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
ORL
2002
106views more  ORL 2002»
14 years 10 months ago
An M/G/1 queue with Markov-dependent exceptional service times
This paper considers an M/G/1 queue in which service time distributions in each busy period change according to a finite state Markov chain, embedded at the arrival instants of cu...
Tomoyuki Kodera, Masakiyo Miyazawa
ORL
2007
84views more  ORL 2007»
14 years 10 months ago
The price of anarchy in an exponential multi-server
We consider a single multi-server memoryless service station. Servers have heterogeneous service rates. Arrivals are routed to one of the servers, and the routing decisions are no...
Moshe Haviv, Tim Roughgarden
ORL
2007
64views more  ORL 2007»
14 years 10 months ago
Robust portfolio selection with uncertain exit time using worst-case VaR strategy
In this paper we consider the robust portfolio selection problem involving two types of uncertainties; the uncertainty in the distribution of exit time and the uncertainty in the ...
Dashan Huang, Frank J. Fabozzi, Masao Fukushima
ORL
2010
85views more  ORL 2010»
14 years 8 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...