Planning and scheduling problems for Earth observation satellites. - Nicola Bianchessi (2006)

Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. - Nicola Bianchessi; Giovanni Righini (Comput. Oper. Res., 2007)

A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. - Nicola Bianchessi; Jean-François Cordeau; Jacques Desrosiers; Gilbert Laporte; Vincent Raymond (Eur. J. Oper. Res., 2007)

Comparison of policies in dynamic routing problems. - Enrico Angelelli; Nicola Bianchessi; Renata Mansini; Maria Grazia Speranza (J. Oper. Res. Soc., 2010)

A column generation approach for the split delivery vehicle routing problem. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza (Networks, 2011)

Optimal solutions for routing problems with profits. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza (Discret. Appl. Math., 2013)

The capacitated team orienteering problem with incomplete service. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza (Optim. Lett., 2013)

Optimal interval scheduling with a resource constraint. - Enrico Angelelli; Nicola Bianchessi; Carlo Filippi (Comput. Oper. Res., 2014)

A branch-and-price algorithm for the robust graph coloring problem. - Claudia Archetti; Nicola Bianchessi; Alain Hertz (Discret. Appl. Math., 2014)

Branch-and-cut algorithms for the split delivery vehicle routing problem. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza (Eur. J. Oper. Res., 2014)

The distance constrained multiple vehicle traveling purchaser problem. - Nicola Bianchessi; Renata Mansini; Maria Grazia Speranza (Eur. J. Oper. Res., 2014)

Formulations for an inventory routing problem. - Claudia Archetti; Nicola Bianchessi; Stefan Irnich; M. Grazia Speranza (Int. Trans. Oper. Res., 2014)

The split delivery capacitated team orienteering problem. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza; Alain Hertz (Networks, 2014)

Incomplete service and split deliveries in a routing problem with profits. - Claudia Archetti; Nicola Bianchessi; Maria Grazia Speranza; Alain Hertz (Networks, 2014)

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. - Claudia Archetti; Nicola Bianchessi; M. Grazia Speranza (Comput. Oper. Res., 2015)

Directed weighted improper coloring for cellular channel allocation. - Claudia Archetti; Nicola Bianchessi; Alain Hertz; Adrien Colombet; François Gagnon (Discret. Appl. Math., 2015)

A branch-and-cut algorithm for the Team Orienteering Problem. - Nicola Bianchessi; Renata Mansini; M. Grazia Speranza (Int. Trans. Oper. Res., 2018)

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. - Christian Tilk; Nicola Bianchessi; Michael Drexl; Stefan Irnich; Frank Meisel (Transp. Sci., 2018)

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. - Timo Gschwind; Nicola Bianchessi; Stefan Irnich (Eur. J. Oper. Res., 2019)

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. - Nicola Bianchessi; Michael Drexl; Stefan Irnich (Transp. Sci., 2019)

Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. - Nicola Bianchessi; Stefan Irnich (Transp. Sci., 2019)

The Team Orienteering Problem with Overlaps: An Application in Cash Logistics. - Christos Orlis; Nicola Bianchessi; Roberto Roberti; Wout Dullaert (Transp. Sci., 2020)

A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts. - Nicola Bianchessi; Emanuele Tresoldi (Comput. Oper. Res., 2021)

A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. - Nicola Bianchessi; Stefan Irnich; Christian Tilk (Discret. Appl. Math., 2021)

The Profitable Close-Enough Arc Routing Problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Comput. Oper. Res., 2022)

The min-max close-enough arc routing problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Eur. J. Oper. Res., 2022)

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. - Michele Barbato; Nicola Bianchessi (CoRR, 2023)

On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm. - Nicola Bianchessi (Networks, 2023)

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. - Nicola Bianchessi; Timo Gschwind; Stefan Irnich (INFORMS J. Comput., 2024)

On the zero-inventory-ordering policy in the inventory routing problem. - Ali Diabat; Nicola Bianchessi; Claudia Archetti (Eur. J. Oper. Res., 2024)

NPB-PSTL: C++ STL Algorithms with Parallel Execution Policies in NAS Parallel Benchmarks. - Júnior Löff; Renato B. Hoffmann; Nicola Bianchessi; Leonardo Mallmann; Dalvan Griebler; Walter Binder (PDP, 2025)

NPB-Rust: NAS Parallel Benchmarks in Rust. - Eduardo M. Martins; Leonardo G. Faé; Renato B. Hoffmann; Nicola Bianchessi; Dalvan Griebler (CoRR, 2025)

Sub-Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial-Size Formulations. - Michele Barbato; Nicola Bianchessi (Networks, 2025)