The goal of this paper is twofold. Firstly a short proof of the unicity of the reduced form of a normal form game is provided, using a technique to reduce a game originally introduced by Mertens. Secondly a direct combinatorial-geometric interpretation of the reduced form is described. This...

We consider a robotic flowshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some predefined interval. The objective is to find a feasible schedule with minimal cycle time....

NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge,...

In this paper we describe the problem of routing trains through a railway station. This routing problem is a subproblem of the automatic generation of timetables for the Dutch railway system. The problem of routing trains through a railway station is the problem of assigning each of the involved...

Abstract not available

The goal of this paper is twofold. Firstly a short proof of the unicity of the reduced form of a normal form game is provided, using a technique to reduce a game originally introduced by Mertens. Secondly a direct combinatorial-geometric interpretation of the reduced form is described. This...

We consider a robotic flowshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some predefined interval. The objective is to find a feasible schedule with minimal cycle time....

We report new results for a time-indexed formulation of nonpreemptive single- machine scheduling problems. We give complete characterizations of all facet induc- ing inequalities with integral coecients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules,...

NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge,...

In this paper we describe the problem of routing trains through a railway station. This routing problem is a subproblem of the automatic generation of timetables for the Dutch railway system. The problem of routing trains through a railway station is the problem of assigning each of the involved...