All Stories

  1. Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations

    Article • Networks, January 2025, Wiley

    Nicola Bianchessi

  2. On the zero-inventory-ordering policy in the inventory routing problem

    Article • European Journal of Operational Research, February 2024, Elsevier

    Nicola Bianchessi

  3. Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems

    Article • INFORMS Journal on Computing, January 2024, INFORMS

    Nicola Bianchessi

  4. On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm

    Article • Networks, March 2023, Wiley

    Nicola Bianchessi

  5. A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand

    Article • Discrete Applied Mathematics, January 2021, Elsevier

    Nicola Bianchessi

  6. The Team Orienteering Problem with Overlaps: An Application in Cash Logistics

    Article • Transportation Science, March 2020, INFORMS

    Nicola Bianchessi

  7. Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem

    Article • European Journal of Operational Research, October 2019, Elsevier

    Nicola Bianchessi

  8. The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints

    Article • Transportation Science, July 2019, INFORMS

    Nicola Bianchessi

  9. Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows

    Article • Transportation Science, March 2019, INFORMS

    Nicola Bianchessi

  10. Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem

    Article • Transportation Science, June 2017, INFORMS

    Nicola Bianchessi

  11. A branch‐and‐cut algorithm for the Team Orienteering Problem

    Article • International Transactions in Operational Research, May 2017, Wiley

    Nicola Bianchessi

  12. A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem

    Article • Computers & Operations Research, December 2015, Elsevier

    Nicola Bianchessi

  13. Directed weighted improper coloring for cellular channel allocation

    Article • Discrete Applied Mathematics, February 2015, Elsevier

    Nicola Bianchessi

  14. Optimal interval scheduling with a resource constraint

    Article • Computers & Operations Research, November 2014, Elsevier

    Nicola Bianchessi

  15. Branch-and-cut algorithms for the split delivery vehicle routing problem

    Article • European Journal of Operational Research, November 2014, Elsevier

    Nicola Bianchessi

  16. The distance constrained multiple vehicle traveling purchaser problem

    Article • European Journal of Operational Research, May 2014, Elsevier

    Nicola Bianchessi

  17. A branch-and-price algorithm for the robust graph coloring problem

    Article • Discrete Applied Mathematics, March 2014, Elsevier

    Nicola Bianchessi

  18. Formulations for an inventory routing problem

    Article • International Transactions in Operational Research, February 2014, Wiley

    Nicola Bianchessi

  19. The split delivery capacitated team orienteering problem

    Article • Networks, October 2013, Wiley

    Nicola Bianchessi

  20. Incomplete service and split deliveries in a routing problem with profits

    Article • Networks, October 2013, Wiley

    Nicola Bianchessi

  21. Optimal solutions for routing problems with profits

    Article • Discrete Applied Mathematics, March 2013, Elsevier

    Nicola Bianchessi

  22. The capacitated team orienteering problem with incomplete service

    Article • Optimization Letters, September 2012, Springer Science + Business Media

    Nicola Bianchessi

  23. A column generation approach for the split delivery vehicle routing problem

    Article • Networks, October 2011, Wiley

    Nicola Bianchessi

  24. Short Term Strategies for a Dynamic Multi-Period Routing Problem

    Article • Transportation Research Part C Emerging Technologies, April 2009, Elsevier

    Nicola Bianchessi

  25. Comparison of policies in dynamic routing problems

    Article • Journal of the Operational Research Society, March 2009, Nature

    Nicola Bianchessi

  26. Management Policies in a Dynamic Multi Period Routing Problem

    Article • January 2009, Springer Science + Business Media

    Nicola Bianchessi

  27. Planning and scheduling algorithms for the COSMO-SkyMed constellation

    Article • Aerospace Science and Technology, October 2008, Elsevier

    Nicola Bianchessi

  28. A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites

    Article • European Journal of Operational Research, March 2007, Elsevier

    Nicola Bianchessi

  29. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery

    Article • Computers & Operations Research, February 2007, Elsevier

    Nicola Bianchessi