This paper studies a single removable server queueing system with Poisson arrivals and k-type hyper-exponential service time distribution operating under the N-policy. The server may be turned on at arrival epochs or off at departure epochs. We show that the probability that the server is busy...

Inventory constraints refer to so-called cumulative resources, which can store a single or several different products and have a prescribed minimum and maximum inventory, where the inventory is depleted and replenished over time. Some additional applications of cumulative resources, e.g. to...

In this paper we consider a new class of continuous location problems where the “distances” are measured by gauges of closed (not necessarily bounded) convex sets. These distance functions do not satisfy the definiteness property and therefore they can be used to model those situations where...

We consider an M|E <Subscript> N </Subscript>|1 queue in which there are two essential on-line decisions that have to be taken. The first one is the decision to either accept or reject new jobs. The second one is the decision to either continue or abort the service of a job. We show that under certain regularity...</subscript>

We will introduce the notation of the generalized reduced game to “unify” the representations for maximal subclasses of the classes of essential games (superadditive games and convex games) that are closed under reduction in the sense of Sobolev (1975), Hart and Mas-Colell (1989), and Moulin...

This work concerns discrete-time Markov decision processes with finite state space and bounded costs per stage. The decision maker ranks random costs via the expectation of the utility function associated to a constant risk sensitivity coefficient, and the performance of a control policy is...

The aim of this paper is to characterize in terms of classical convexity and quasiconvexity of extended real-valued functions those set-valued maps which are K-convex or K-quasiconvex with respect to a convex cone K. In particular, we recover some known characterizations of K-convex and...

We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called...