This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...
Abstract In this paper, the use of queueing theory for modeling uninterrupted traffic flows is evaluated. Empirical data on speeds and flows are used to evaluate speeds generated b...
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...