Righini Giovanni

Full professor
SSD
MAT/09 - OPERATIONS RESEARCH
Competition sector
01/A6 - OPERATIONS RESEARCH

Contacts

Workplace

Via Celoria, 18

Office phone number
02503 30060
Additional phone numbers
0373898 060
University email address
Web site
Research

Publications

Publications
  • Automated tuning of a column generation algorithm / D. Bezzi, A. Ceselli, G. Righini (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE). - In: Learning and Intelligent Optimization / [a cura di] I. Kotsireas, P. Pardalos. - Prima edizione. - [s.l] : Springer, 2020. - ISBN 9783030535513. - pp. 201-215 (( Intervento presentato al 14. convegno International Conference on Learning and Intelligent Optimization tenutosi a Athens nel 2020.
  • Paths and Matchings in an Automated Warehouse / M. Barbato, A. Ceselli, G. Righini (AIRO SPRINGER SERIES). - In: Advances in Optimization and Decision Science for Society, Services and Enterprises / [a cura di] M. Paolucci, A. Sciomachen, P. Uberti. - [s.l] : Springer, 2019. - ISBN 9783030349592. - pp. 151-159 (( convegno ODS tenutosi a Genova nel 2019.
  • A single machine on-time-in-full scheduling problem / M. Casazza, A. Ceselli, G. Righini (DSI WORKSHOP PROCEEDINGS SERIES). - In: Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization / [a cura di] J. Hurink, S. Klootwijk, B. Manthey, V. Reijnders, M. Schoot Uiterkamp. - [s.l] : University of Twente, 2019. - pp. 21-24 (( Intervento presentato al 17. convegno Cologne-Twente Workshop on Graphs and Combinatorial Optimization tenutosi a Enschede nel 2019.
  • Dynamic programming for the Electric Vehicle Orienteering Problem with multiple technologies / D. Bezzi, A. Ceselli, G. Righini. ((Intervento presentato al 7. convegno Odysseus tenutosi a Cagliari nel 2018.
  • A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization / R. Cordone, P. Hosteins, G. Righini. - In: INFORMS JOURNAL ON COMPUTING. - ISSN 1091-9856. - 30:1(2018), pp. 168-180.