Bianchessi Nicola

Fixed-term Research Fellow A
SSD
INF/01 - INFORMATICS
Competition sector
01/B1 - INFORMATICS

Contacts

Workplace

Via Celoria, 18

University email address
Office hours
By appointment
Office
Room 3018 - Via Celoria, 18

Teaching

Research

Publications
  • A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand / N. Bianchessi, S. Irnich, C. Tilk. - (2020 Jan 23).
  • 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.
  • Branch-and-Cut for the split delivery vehicle routing problem with time windows / N. Bianchessi, S. Irnich. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 53:2(2019 Mar), pp. 442-462.