Nicola Bianchessi

33 papers C 1Journal 31
YearRankTypeTitle / Venue / Authors
2025 C conf
NPB-PSTL: C++ STL Algorithms with Parallel Execution Policies in NAS Parallel Benchmarks.
PDP
Júnior Löff, Renato B. Hoffmann, Nicola Bianchessi, Leonardo Mallmann, Dalvan Griebler, Walter Binder
2025 J jnl
NPB-Rust: NAS Parallel Benchmarks in Rust.
CoRR
Eduardo M. Martins, Leonardo G. Faé, Renato B. Hoffmann, Nicola Bianchessi, Dalvan Griebler
2025 J jnl
Sub-Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial-Size Formulations.
Networks
Michele Barbato, Nicola Bianchessi
2024 J jnl
On the zero-inventory-ordering policy in the inventory routing problem.
Eur. J. Oper. Res.
Ali Diabat, Nicola Bianchessi, Claudia Archetti
2024 J jnl
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.
INFORMS J. Comput.
Nicola Bianchessi, Timo Gschwind, Stefan Irnich
2023 J jnl
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm.
Networks
Nicola Bianchessi
2023 J jnl
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage.
CoRR
Michele Barbato, Nicola Bianchessi
2022 J jnl
The Profitable Close-Enough Arc Routing Problem.
Comput. Oper. Res.
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
2022 J jnl
The min-max close-enough arc routing problem.
Eur. J. Oper. Res.
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
2021 J jnl
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.
Discret. Appl. Math.
Nicola Bianchessi, Stefan Irnich, Christian Tilk
2021 J jnl
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts.
Comput. Oper. Res.
Nicola Bianchessi, Emanuele Tresoldi
2020 J jnl
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics.
Transp. Sci.
Christos Orlis, Nicola Bianchessi, Roberto Roberti, Wout Dullaert
2019 J jnl
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows.
Transp. Sci.
Nicola Bianchessi, Stefan Irnich
2019 J jnl
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.
Eur. J. Oper. Res.
Timo Gschwind, Nicola Bianchessi, Stefan Irnich
2019 J jnl
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.
Transp. Sci.
Nicola Bianchessi, Michael Drexl, Stefan Irnich
2018 J jnl
A branch-and-cut algorithm for the Team Orienteering Problem.
Int. Trans. Oper. Res.
Nicola Bianchessi, Renata Mansini, M. Grazia Speranza
2018 J jnl
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem.
Transp. Sci.
Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel
2015 J jnl
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Comput. Oper. Res.
Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza
2015 J jnl
Directed weighted improper coloring for cellular channel allocation.
Discret. Appl. Math.
Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon
2014 J jnl
A branch-and-price algorithm for the robust graph coloring problem.
Discret. Appl. Math.
Claudia Archetti, Nicola Bianchessi, Alain Hertz
2014 J jnl
Branch-and-cut algorithms for the split delivery vehicle routing problem.
Eur. J. Oper. Res.
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
2014 J jnl
Formulations for an inventory routing problem.
Int. Trans. Oper. Res.
Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza
2014 J jnl
Incomplete service and split deliveries in a routing problem with profits.
Networks
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
2014 J jnl
Optimal interval scheduling with a resource constraint.
Comput. Oper. Res.
Enrico Angelelli, Nicola Bianchessi, Carlo Filippi
2014 J jnl
The distance constrained multiple vehicle traveling purchaser problem.
Eur. J. Oper. Res.
Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
2014 J jnl
The split delivery capacitated team orienteering problem.
Networks
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
2013 J jnl
Optimal solutions for routing problems with profits.
Discret. Appl. Math.
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
2013 J jnl
The capacitated team orienteering problem with incomplete service.
Optim. Lett.
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
2011 J jnl
A column generation approach for the split delivery vehicle routing problem.
Networks
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
2010 J jnl
Comparison of policies in dynamic routing problems.
J. Oper. Res. Soc.
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
2007 J jnl
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
Eur. J. Oper. Res.
Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond
2007 J jnl
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery.
Comput. Oper. Res.
Nicola Bianchessi, Giovanni Righini
2006 — —
Planning and scheduling problems for Earth observation satellites.
Nicola Bianchessi