A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one...

This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...

This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists in finding a spanning tree that minimizes...

This paper surveys a large variety of mathematical models and up-to-date solution techniques developed for solving a general flight gate scheduling problem that deals with assigning different aircraft activities (arrival, departure and intermediate parking) to distinct aircraft stands or gates....