In this note we extend the standard DEA paradigm to address the question of how one can price DMUs (decision-making units). To do this we use an adjoint transformation to the technology generated by these DMUs which links to traditional linear programming theory of the firm and is similar to...

We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection (TSP-MTWHS), which generalises the well-known Travelling Salesman Problem with Time Windows and the recently introduced Travelling Salesman Problem with Hotel Selection. The TSP-MTWHS consists...

Crew scheduling is a highly complex combinatorial problem that has substantial and consequential economic importance in practice. Although the core structure of the problem is the same in many different areas like urban transportation, airlines etc, the specific problem instances show...

This paper presents a method to schedule a triple round robin tournament, which involves minitournaments, each hosted by one team. A key issue is that at the end of the season the number of home games should be balanced over the teams, despite the fact that in minitournament matches only the...

Most delays in the air transport occur at the airport. A particular reason is the complexity of managing the large number of supporting flows in airport logistics. We consider the optimisation problem of scheduling de-icing vehicles that is one of the key supporting logistic flows in the...