Nicola Bianchessi
Titolo
Citata da
Citata da
Anno
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
3542007
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
2092007
Planning and scheduling algorithms for the COSMO-SkyMed constellation
N Bianchessi, G Righini
Aerospace Science and Technology 12 (7), 535-544, 2008
1292008
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
932009
A column generation approach for the split delivery vehicle routing problem
C Archetti, N Bianchessi, MG Speranza
Networks 58 (4), 241-254, 2011
862011
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
712014
Optimal solutions for routing problems with profits
C Archetti, N Bianchessi, MG Speranza
Discrete Applied Mathematics 161, 547-557, 2013
712013
Formulations for an inventory routing problem
C Archetti, N Bianchessi, S Irnich, MG Speranza
International Transactions in Operational Research 21 (3), 353-374, 2014
652014
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
392015
The split delivery capacitated team orienteering problem
C Archetti, N Bianchessi, A Hertz, MG Speranza
Networks 63 (1), 16-33, 2013
372013
The Distance Constrained Multiple Vehicle Traveling Purchaser Problem
N Bianchessi, R Mansini, MG Speranza
European Journal of Operational Research 235 (1), 73-87, 2014
292014
Planning and scheduling problems for earth observation satellites: models and algorithms
N Bianchessi
PhD Thesis, 2006
262006
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
252017
The capacitated team orienteering problem with incomplete service
C Archetti, N Bianchessi, MG Speranza
Optimization Letters 7 (7), 1405-1417, 2013
232013
Optimal Interval Scheduling with a Resource Constraint
E Angelelli, N Bianchessi, C Filippi
Computers & Operations Research 51, 268-281, 2014
212014
A branch-and-price algorithm for the robust graph coloring problem
C Archetti, N Bianchessi, A Hertz
Discrete Applied Mathematics 165, 49-59, 2013
192013
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
182018
A mathematical programming algorithm for planning and scheduling an earth observing SAR constellation
N Bianchessi, G Righini
Proceeding of the fifth international workshop on planning and scheduling …, 2006
172006
Incomplete Service and Split Deliveries in a Routing Problem with Profits
C Archetti, N Bianchessi, A Hertz, MG Speranza
Networks 63 (2), 135-145, 2014
152014
Directed weighted improper coloring for cellular channel allocation
C Archetti, N Bianchessi, A Colombet, F Gagnon, A Hertz
Discrete Applied Mathematics, doi: 10.1016/j.dam.2013.11.018, 2013
132013
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20