Nicola Bianchessi

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 14

Top Topics

Routing Problem

Waste Collection

Benchmark Problems

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Discret. Appl. Math.

Publications

Nicola Bianchessi, Timo Gschwind, Stefan Irnich
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36 (1) (2024)
Ali Diabat, Nicola Bianchessi, Claudia Archetti
On the zero-inventory-ordering policy in the inventory routing problem. Eur. J. Oper. Res. 312 (3) (2024)
Nicola Bianchessi
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm. Networks 81 (4) (2023)
Michele Barbato, Nicola Bianchessi
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. CoRR (2023)
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
The Profitable Close-Enough Arc Routing Problem. Comput. Oper. Res. 140 (2022)
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300 (3) (2022)
Nicola Bianchessi, Stefan Irnich, Christian Tilk
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288 (2021)
Nicola Bianchessi, Emanuele Tresoldi
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts. Comput. Oper. Res. 136 (2021)
Christos Orlis, Nicola Bianchessi, Roberto Roberti, Wout Dullaert
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics. Transp. Sci. 54 (2) (2020)
Timo Gschwind, Nicola Bianchessi, Stefan Irnich
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278 (1) (2019)
Nicola Bianchessi, Michael Drexl, Stefan Irnich
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. Transp. Sci. 53 (4) (2019)
Nicola Bianchessi, Stefan Irnich
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. Transp. Sci. 53 (2) (2019)
Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. Transp. Sci. 52 (2) (2018)
Nicola Bianchessi, Renata Mansini, M. Grazia Speranza
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25 (2) (2018)
Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput. Oper. Res. 64 (2015)
Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon
Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182 (2015)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
The split delivery capacitated team orienteering problem. Networks 63 (1) (2014)
Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21 (3) (2014)
Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235 (1) (2014)
Enrico Angelelli, Nicola Bianchessi, Carlo Filippi
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51 (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238 (3) (2014)
Claudia Archetti, Nicola Bianchessi, Alain Hertz
A branch-and-price algorithm for the robust graph coloring problem. Discret. Appl. Math. 165 (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
Incomplete service and split deliveries in a routing problem with profits. Networks 63 (2) (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161 (4-5) (2013)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7 (7) (2013)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
A column generation approach for the split delivery vehicle routing problem. Networks 58 (4) (2011)
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61 (4) (2010)
Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. Eur. J. Oper. Res. 177 (2) (2007)
Nicola Bianchessi, Giovanni Righini
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34 (2) (2007)