Bianchessi Nicola
RICERCATORE A TEMPO DETERMINATO (Lettera A)
SSD
INF/01 - INFORMATICA
Settore concorsuale
01/B1 - INFORMATICA
Competenze e ambito di ricerca
Contatti
Sede di lavoro
E-mail di ateneo
Didattica - insegnamenti
Corsi di laurea
A.A. 2020/2021
A.A. 2019/2020
A.A. 2018/2019
Ricerca
Pubblicazioni
Pubblicazioni
-
A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand / N. Bianchessi, S. Irnich, C. Tilk. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 288(2021 Jan 15), pp. 152-170.
-
The Team Orienteering Problem with Overlaps : An Application in Cash Logistics / C. Orlis, N. Bianchessi, R. Roberti, W. Dullaert. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 54:2(2020 Mar), pp. 470-487.
-
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem / T. Gschwind, N. Bianchessi, S. Irnich. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 278:1(2019 Oct), pp. 91-104.
-
The Team Orienteering Problem with Overlaps / C. Orlis, N. BIANCHESSI, W. Dullaert, R. Roberti. ((Intervento presentato al convegno International Conference on Optimization and Decision Science, XLIX Annual Meeting of AIRO - Italian Operations Research Society - ODS 2019 tenutosi a Genova nel 2019.
-
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints / N. Bianchessi, S. Irnich, M. Drexl. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 53:4(2019 Aug), pp. 1067-1084.