Sciweavers

ORL
2008
87views more  ORL 2008»
13 years 4 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
ORL
2008
106views more  ORL 2008»
13 years 5 months ago
Computing shortest heterochromatic monotone routes
José Miguel Díaz-Báñez...
ORL
2008
115views more  ORL 2008»
13 years 5 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
ORL
2008
86views more  ORL 2008»
13 years 5 months ago
Searching the k-change neighborhood for TSP is W[1]-hard
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
Dániel Marx
ORL
2006
64views more  ORL 2006»
13 years 5 months ago
Optimal prices for finite capacity queueing systems
We prove a lower bound on the optimal price for a fairly large class of blocking systems with general arrival and service processes, determine optimal price expressions for M/M/1/...
Serhan Ziya, Hayriye Ayhan, Robert D. Foley
ORL
2006
85views more  ORL 2006»
13 years 5 months ago
A simple proof of diffusion approximations for LBFS re-entrant lines
For a re-entrant line operating under the last-buffer
Jiankui Yang, J. G. Dai, Jian-Gong You, Hanqin Zha...
ORL
2006
103views more  ORL 2006»
13 years 5 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
ORL
2006
92views more  ORL 2006»
13 years 5 months ago
The k-level facility location game
We propose a cost-sharing scheme for the k-level facility location game that is cross-monotonic, competitive, and 6-approximate cost recovery. This extends the recent result for t...
Dachuan Xu, Donglei Du
ORL
2006
84views more  ORL 2006»
13 years 5 months ago
An M/M/1 retrial queue with unreliable server
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the s...
Nathan P. Sherman, Jeffrey P. Kharoufeh
ORL
2006
118views more  ORL 2006»
13 years 5 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro