This work is an up-to-date-extension of a previous annotated bibliography (2004) which covered 40 references only. It focuses on what has been published during the last ten years in the area of combinatorial optimization and scheduling theory concerning robustness and other similar techniques...

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....

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...