In this paper we introduce robust versions of the classical static and dynamic single leg seat allocation models as analyzed by Wollmer, and Lautenbacher and Stidham, respectively. These robust models take into account the inaccurate estimates of the underlying probability distributions. As...

We present a new method for visualizing similarities between objects. The method is called VOS, which is an abbreviation for visualization of similarities. The aim of VOS is to provide a low-dimensional visualization in which objects are located in such a way that the distance between any pair...

We describe an algorithmic approach to determine an efficient railway rolling stock circulation on a single line or on a set of interacting lines. Given the timetable and the passengers? seat demand, we develop a branch-and-price algorithm that results in an allocation of rolling stock material...

Firms nowadays need to make decisions with fast information obsolesce. In this paper I deal with one class of decision problems in this situation, called the “one-sample” problems: we have finite options and one sample of the multiple criteria with which we use to evaluate those options. I...

The roster planning process at the Dutch security firm NVD was traditionally carried out by hand. A few years NVD was traditionally carried out by hand. A few years ago, because of changing labor laws in the Netherlands, this became practically impossible. We developed a decision support system...

In this paper we consider the problem of integrated scheduling of various types of handling equipment at an automated container terminal, where the objective is to minimize the makespan of the schedule. We present a Branch & Bound algorithm that uses various combinatorial lower bounds....

In the past thirty years the full turnover-based storage policy as described by Hausman et al. (1976, Management Science 22(6)) has been widely claimed to outperform the commonly used ABC class-based storage policy, in terms of the resulting average storage and retrieval machine travel time. In...

In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the...

This paper contains the dataset for the refrigerator case concerning the design of a production and return network for refrigerators. Section 1 emphasises the major changes to the problem structure and assumptions used by Umeda et al. (1999). Section 2 contains the parameter settings. Section 3...

This paper proposes a new algorithm for target selection. This algorithm collects all frequent patterns (equivalent to frequent item sets) in a training set. These patterns are stored e?ciently using a compact data structure called a trie. For each pattern the relative frequency of the target...