Nicola Bianchessi

University of Milan — Italy

Engineering · Physical Sciences

19h-index1.7kcitations49works1.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Vehicle Routing Optimization Methods(32), Transportation and Mobility Innovations(19), Optimization and Packing Problems(15), Optimization and Search Problems(10), Urban and Freight Transport Logistics(10)

Publications49 total

Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations
Networks·2025· 1 citedOpen Access
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems
INFORMS journal on computing·2023· 1 citedOpen Access
On the zero-inventory-ordering policy in the inventory routing problem
European Journal of Operational Research·2023· 13 citedOpen Access
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm
Networks·2023· 2 citedOpen Access
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage
arXiv (Cornell University)·2023Open Access
The Profitable Close-Enough Arc Routing Problem
Computers & Operations Research·2021· 12 citedOpen Access
The min-max close-enough arc routing problem
European Journal of Operational Research·2021· 11 citedOpen Access
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Computers & Operations Research·2021· 9 citedOpen Access
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
Discrete Applied Mathematics·2020· 16 citedOpen Access
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics
Transportation Science·2020· 20 citedOpen Access
A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand
RePEc: Research Papers in Economics·2020
The Team Orienteering Problem with Overlaps
2019
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
Transportation Science·2019· 33 citedOpen Access
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
European Journal of Operational Research·2019· 38 citedOpen Access
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
Transportation Science·2019· 49 citedOpen Access
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem
Transportation Science·2017· 51 citedOpen Access
A branch‐and‐cut algorithm for the Team Orienteering Problem
International Transactions in Operational Research·2017· 69 citedOpen Access
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
RePEc: Research Papers in Economics·2017
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
RePEc: Research Papers in Economics·2016· 1 cited
Branch-and-Price for the Active-Passive Vehicle-Routing Problem
RePEc: Research Papers in Economics·2015· 2 cited
page 1 of 3Next →

Frequent Co-authors

Claudia Archetti(15), M. Grazia Speranza(15), Stefan Irnich(12), Alain Hertz(8), Giovanni Righini(6), Renata Mansini(5), Enrico Angelelli(4), Christian Tilk(4), Michael Drexl(4), Timo Gschwind(3), Jacques Desrosiers(2), Gilbert Laporte(2), Vincent Raymond(2), Frank Meisel(2), Adrien Colombet(2), François Gagnon(2), Marco Roveri(2), Giovanni Laneve(2), A. Zigrino(2), Ángel Corberán(2)