Bianchessi Nicola

RICERCATORE A TEMPO DETERMINATO (Lettera A)
SSD
INF/01 - INFORMATICA
Settore concorsuale
01/B1 - INFORMATICA

Contatti

E-mail di ateneo
Ricevimento
Su appuntamento
Luogo di ricevimento
Stanza 3018 - Via Celoria, 18

Didattica

A.A. 2019/2020

A.A. 2018/2019

Ricerca

Pubblicazioni
  • 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 Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints / N. Bianchessi, S. Irnich, M. Drexl. - In: TRANSPORTATION SCIENCE. - ISSN 1526-5447. - 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.
  • A branch-and-cut algorithm for the Team Orienteering Problem / N. Bianchessi, R. Mansini, M.G. Speranza. - In: INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH. - ISSN 0969-6016. - 25:2(2018), pp. 627-635.
  • Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem / C. Tilk, N. Bianchessi, M. Drexl, S. Irnich, F. Meisel. - In: TRANSPORTATION SCIENCE. - ISSN 0041-1655. - 52:2(2018), pp. 300-319.