We consider a profit maximization problem when pricing a set of m items which can be represented as the edges of an undirected multi graph G. There is a set of n customers, each of which is interested in purchasing a bundle of edges of G, and we assume that these edges form a simple path in G....

We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to...

We consider a stochastic scheduling problem which generalizes traditional stochastic scheduling by introducing parameter uncertainty. Two classes of independent jobs have to be processed by a single machine so as to minimize the sum of expected completion times. The processing times of the jobs...

We consider a stochastic scheduling problem in which there is uncertainty about parame-ters of the probability distribution of the processing times. We restrict ourselves to the setting in which there are two different classes of jobs. The processing times of the jobs are assumed to be...

The performance of wireless networks suffers from collisions. These occur when multiplewireless nodes transmit simultaneously, and their signals interfere with each other. To reduce collisions, nodes may use a randomized protocol to regulate their behavior. An example of such a protocol is...

Preface -- Chapter 1. Basic Notions and Definitions -- 1.1. Introduction -- 1.2. Basic Notions of Analysis and Linear Algebra -- 1.3. Basic Notions and Properties of Optimization Problems -- Chapter 2. Elements of Convex Analysis. Theorems of the Alternative for Linear Systems. Tangent Cones --...

In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds significantly...

We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...

In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: it sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior or it...