BIANCHESSI, NICOLA
BIANCHESSI, NICOLA
Dipartimento di Informatica Giovanni Degli Antoni
Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage: Complexity and Polynomial-Size Formulations
2025 M. Barbato, N. Bianchessi
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems
2024 N. Bianchessi, T. Gschwind, S. Irnich
On the zero-inventory-ordering policy in the inventory routing problem
2024 A. Diabat, N. Bianchessi, C. Archetti
Replication data for "Sub-tree scheduling for wireless sensor networks with partial coverage: complexity and polynomial-size formulations"
2023 M. Barbato, N. Bianchessi
Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage (STSWSN-PC) Dataset
2023 N. Bianchessi
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: a branch-and-cut algorithm
2023 N. Bianchessi
The min-max close-enough arc routing problem
2022 N. Bianchessi, A. Corberan, I. Plana, M. Reula, J.M. Sanchis
The Profitable Close Enough Arc Routing Problem
2022 N. Bianchessi, Á. Corberán, I. Plana, M. Reula, J.M. Sanchis
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
2021 N. Bianchessi, E. Tresoldi
A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand
2021 N. Bianchessi, S. Irnich, C. Tilk
The Team Orienteering Problem with Overlaps : An Application in Cash Logistics
2020 C. Orlis, N. Bianchessi, R. Roberti, W. Dullaert
The Team Orienteering Problem with Overlaps
2019 C. Orlis, N. Bianchessi, W. Dullaert, R. Roberti
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
2019 T. Gschwind, N. Bianchessi, S. Irnich
Branch-and-Cut for the split delivery vehicle routing problem with time windows
2019 N. Bianchessi, S. Irnich
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
2019 N. Bianchessi, S. Irnich, M. Drexl
A branch-and-cut algorithm for the Team Orienteering Problem
2018 N. Bianchessi, R. Mansini, M.G. Speranza
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem
2018 C. Tilk, N. Bianchessi, M. Drexl, S. Irnich, F. Meisel
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
2015 C. Archetti, N. Bianchessi, M.G. Speranza
Directed weighted improper coloring for cellular channel allocation
2015 C. Archetti, N. Bianchessi, A. Hertz, A. Colombet, F. Gagnon
The distance constrained multiple vehicle traveling purchaser problem
2014 N. Bianchessi, R. Mansini, M.G. Speranza