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...
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...
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...
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/...
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...
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...
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...
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...