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 ...
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...
Sorting models consist in assigning alternatives evaluated on several criteria to ordered categories. To implement such models it is necessary to set the values of the preference p...
We propose heuristic and exact algorithms for the (periodic and non-periodic) train timetabling problem on a corridor that are based on the solution of the LP relaxation of an ILP...
Most of the liberalized electricity systems use the auction as a market model. The complexity of the underlying optimization formulation depends on the technical and regulatory con...