Nicola Bianchessi

Orcid: 0000-0002-5722-5476

According to our database1, Nicola Bianchessi authored at least 30 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the zero-inventory-ordering policy in the inventory routing problem.
Eur. J. Oper. Res., February, 2024

Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems.
INFORMS J. Comput., 2024

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

On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage.
CoRR, 2023

2022
The min-max close-enough arc routing problem.
Eur. J. Oper. Res., 2022

The Profitable Close-Enough Arc Routing Problem.
Comput. Oper. Res., 2022

2021
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.
Discret. Appl. Math., 2021

A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts.
Comput. Oper. Res., 2021

2020
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics.
Transp. Sci., 2020

2019
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows.
Transp. Sci., 2019

The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints.
Transp. Sci., 2019

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem.
Eur. J. Oper. Res., 2019

2018
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem.
Transp. Sci., 2018

A branch-and-cut algorithm for the Team Orienteering Problem.
Int. Trans. Oper. Res., 2018

2015
Directed weighted improper coloring for cellular channel allocation.
Discret. Appl. Math., 2015

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Comput. Oper. Res., 2015

2014
Incomplete service and split deliveries in a routing problem with profits.
Networks, 2014

The split delivery capacitated team orienteering problem.
Networks, 2014

Formulations for an inventory routing problem.
Int. Trans. Oper. Res., 2014

The distance constrained multiple vehicle traveling purchaser problem.
Eur. J. Oper. Res., 2014

Branch-and-cut algorithms for the split delivery vehicle routing problem.
Eur. J. Oper. Res., 2014

A branch-and-price algorithm for the robust graph coloring problem.
Discret. Appl. Math., 2014

Optimal interval scheduling with a resource constraint.
Comput. Oper. Res., 2014

2013
The capacitated team orienteering problem with incomplete service.
Optim. Lett., 2013

Optimal solutions for routing problems with profits.
Discret. Appl. Math., 2013

2011
A column generation approach for the split delivery vehicle routing problem.
Networks, 2011

2010
Comparison of policies in dynamic routing problems.
J. Oper. Res. Soc., 2010

2007
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites.
Eur. J. Oper. Res., 2007

Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery.
Comput. Oper. Res., 2007

2006
Planning and scheduling problems for Earth observation satellites.
PhD thesis, 2006


  Loading...