In this chapter a review of recent results on robust discrete optimization is presented. The
most popular discrete and interval uncertainty representations are discussed. Various robust …

This paper describes an incremental neighbourhood tabu search heuristic for the
generalized vehicle routing problem with time windows. The purpose of this work is to offer a …

In this paper, the problem of selecting p out of n available items is discussed, such that their
total cost is minimized. We assume that the item costs are not known exactly, but stem from a …

We investigate the so-called recoverable robust assignment problem on balanced bipartite
graphs with $2 n $ vertices, a mainstream problem in robust optimization: For two given …

Network expansion problems are a special class of multi-period network design problems in
which arcs can be opened gradually in different time periods but can never be closed …

This article deals with the recoverable robust shortest path problem under interval
uncertainty representations. In this problem, a first‐stage path is computed, which can be …

In this paper, we consider an adaptive approach to address optimization problems with
uncertain cost parameters. Here, the decision maker selects an initial decision, observes the …

This paper deals with the recoverable robust spanning tree problem under interval
uncertainty representations. A strongly polynomial time, combinatorial algorithm for the …

Timetable information is the process of determining a suitable travel route for a passenger.
Due to delays in the original timetable, in practice it often happens that the travel route …

Transportation discrete network design problem (DNDP) is about how to modify an existing
network of roads and highways in order to improve its total system travel time, and the …