The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have become more popular among practitioners than SVM thanks to their interpretability, which is an important issue in Data...

In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover in detail...

In this paper we introduce the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not necessary to operate a given timetable. We discuss several aspects of this problem and focus on two subproblems. We propose mathematical models...

This paper describes a model that generates weekly movie schedules in a multiplex movie theater. A movie schedule specifies within each day of the week, on which screen(s) different movies will be played, and at which time(s). The model consists of two parts: (i) conditional forecasts of the...

This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the literature, which considers mainly partial integration. Our approach is new in the sense that we can...

This paper deals with a practical application of an integrated approach to vehicle and crew scheduling, that we have developed previously. Computational results have shown that our approach can be applied to problems of practical size. However, application of the approach to the actual problems...

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master...

Industrial lotsizing and scheduling pose very difficult analytical problems. We propose an unconventional model that deals with sequence-dependent setup costs in a multiple-machine environment. The sequence-splitting model splits an entire schedule into subsequences, leading to tractable...

This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as necessary, the existing flight departure schedules and planned individual work days (duties) while keeping planned aircraft itineraries...