Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery N Bianchessi, G Righini Computers & Operations Research 34 (2), 578-594, 2007 | 426 | 2007 |
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites N Bianchessi, JF Cordeau, J Desrosiers, G Laporte, V Raymond European Journal of Operational Research 177 (2), 750-762, 2007 | 296 | 2007 |
Planning and scheduling algorithms for the COSMO-SkyMed constellation N Bianchessi, G Righini Aerospace Science and Technology 12 (7), 535-544, 2008 | 165 | 2008 |
A column generation approach for the split delivery vehicle routing problem C Archetti, N Bianchessi, MG Speranza Networks 58 (4), 241-254, 2011 | 130 | 2011 |
Branch-and-Cut Algorithms for the Split Delivery Vehicle Routing Problem C Archetti, N Bianchessi, MG Speranza European Journal of Operational Research 238 (3), 685-698, 2014 | 125 | 2014 |
Short term strategies for a dynamic multi-period routing problem E Angelelli, N Bianchessi, R Mansini, MG Speranza Transportation Research Part C: Emerging Technologies 17 (2), 106-119, 2009 | 118 | 2009 |
Formulations for an inventory routing problem C Archetti, N Bianchessi, S Irnich, MG Speranza International Transactions in Operational Research 21 (3), 353-374, 2014 | 104 | 2014 |
Optimal solutions for routing problems with profits C Archetti, N Bianchessi, MG Speranza Discrete Applied Mathematics 161, 547-557, 2013 | 99 | 2013 |
A branch-and-cut algorithm for the Team Orienteering Problem N Bianchessi, R Mansini, MG Speranza International Transactions in Operational Research, DOI:10.1111/itor.12422, 2017 | 75 | 2017 |
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem C Archetti, N Bianchessi, MG Speranza Computers & Operations Research 64, 1-10, 2015 | 70 | 2015 |
Branch-and-cut for the split delivery vehicle routing problem with time windows N Bianchessi, S Irnich Transportation Science 53 (2), 442-462, 2019 | 45 | 2019 |
Optimal Interval Scheduling with a Resource Constraint E Angelelli, N Bianchessi, C Filippi Computers & Operations Research 51, 268-281, 2014 | 45 | 2014 |
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem N Bianchessi, R Mansini, MG Speranza European Journal of Operational Research 235 (1), 73-87, 2014 | 44 | 2014 |
The split delivery capacitated team orienteering problem C Archetti, N Bianchessi, A Hertz, MG Speranza Networks 63 (1), 16-33, 2013 | 44 | 2013 |
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints N Bianchessi, M Drexl, S Irnich Transportation Science, 2019 | 39 | 2019 |
Branch-and-price-and-cut for the active-passive vehicle-routing problem C Tilk, N Bianchessi, M Drexl, S Irnich, F Meisel Transportation Science 52 (2), 300-319, 2018 | 39 | 2018 |
Stabilized Branch-Price-and-Cut for the Commodity-constrained Split Delivery Vehicle Routing Problem T Gschwind, N Bianchessi, S Irnich European Journal of Operational Research, 2019 | 33 | 2019 |
The capacitated team orienteering problem with incomplete service C Archetti, N Bianchessi, MG Speranza Optimization Letters 7 (7), 1405-1417, 2013 | 30 | 2013 |
Planning and scheduling problems for earth observation satellites: models and algorithms N Bianchessi PhD Thesis, 2006 | 29 | 2006 |
A branch-and-price algorithm for the robust graph coloring problem C Archetti, N Bianchessi, A Hertz Discrete Applied Mathematics 165, 49-59, 2013 | 25 | 2013 |