All Stories

  1. Exact Solutions for the Carrier–Vehicle Traveling Salesman Problem

    Article • Transportation Science, September 2017, INFORMS

    Prof. Daniele Vigo, claudio gambella

  2. A service network design model for multimodal municipal solid waste transport

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

    Prof. Daniele Vigo

  3. Intermediate Facilities in Freight Transportation Planning: A Survey

    Article • Transportation Science, August 2016, INFORMS

    Prof. Daniele Vigo

  4. An optimization approach for district heating strategic network design

    Article • European Journal of Operational Research, July 2016, Elsevier

    Prof. Daniele Vigo

  5. Supplier’s total cost of ownership evaluation: a data envelopment analysis approach

    Article • Omega, June 2016, Elsevier

    Prof. Daniele Vigo

  6. Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem

    Article • Operations Research, April 2016, INFORMS

    Prof. Daniele Vigo

  7. From a Real Deployment to a Downscaled Testbed: A Methodological Approach

    Article • IEEE Internet of Things Journal, January 2016, Institute of Electrical & Electronics Engineers (IEEE)

    Prof. Daniele Vigo

  8. Territory-Based Vehicle Routing in the Presence of Time-Window Constraints

    Article • Transportation Science, November 2015, INFORMS

    Prof. Daniele Vigo, Dr. Michael Schneider

  9. Enhanced exact solution methods for the Team Orienteering Problem

    Article • International Journal of Production Research, July 2015, Taylor & Francis

    Prof. Daniele Vigo

  10. A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem

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

    Prof. Daniele Vigo

  11. Integrated vehicle routing problems

    Article • Computers & Operations Research, March 2015, Elsevier

    Prof. Daniele Vigo

  12. Vehicle Routing

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  13. Chapter 2: Classical Exact Algorithms for the Capacitated Vehicle Routing Problem

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  14. Chapter 10: Vehicle Routing Problems with Profits

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  15. Chapter 9: Four Variants of the Vehicle Routing Problem

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  16. Chapter 1: The Family of Vehicle Routing Problems

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  17. An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows

    Article • Computers & Operations Research, November 2014, Elsevier

    Prof. Daniele Vigo

  18. SPRINT: Optimization of Staff Management for Desk Customer Relations Services at Hera

    Article • INFORMS Journal on Applied Analytics, October 2014, INFORMS

    Prof. Daniele Vigo

  19. Two-Dimensional Bin Packing Problems

    Article • August 2014, Wiley

    Prof. Daniele Vigo

  20. Guest editorial to the Special Issue “Routing and Logistics” (VeRoLog 2012)

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

    Prof. Daniele Vigo

  21. Exact Algorithms for the Clustered Vehicle Routing Problem

    Article • Operations Research, February 2014, INFORMS

    Prof. Daniele Vigo

  22. Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management

    Article • Transportation Science, February 2014, INFORMS

    Prof. Daniele Vigo, Richard Hartl

  23. Chapter 15: Routing in Waste Collection Applications

    Article • October 2013, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  24. Vehicle routing: historical perspective and recent contributions

    Article • EURO Journal on Transportation and Logistics, March 2013, Springer Science + Business Media

    Prof. Daniele Vigo

  25. Two-Dimensional Bin Packing Problems

    Article • February 2013, Wiley

    Prof. Daniele Vigo

  26. An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping

    Article • Transportation Science, February 2013, INFORMS

    Prof. Daniele Vigo

  27. Bin Packing Approximation Algorithms: Survey and Classification

    Article • January 2013, Springer Science + Business Media

    Prof. Daniele Vigo

  28. A problem-adjusted genetic algorithm for flexibility design

    Article • International Journal of Production Economics, January 2013, Elsevier

    Prof. Daniele Vigo

  29. Location routing for small package shippers with subcontracting options

    Article • International Journal of Production Economics, December 2012, Elsevier

    Prof. Daniele Vigo

  30. Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

    Article • Computers & Operations Research, May 2012, Elsevier

    Prof. Daniele Vigo

  31. The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics

    Article • Transportation Science, August 2011, INFORMS

    Prof. Daniele Vigo

  32. Exact Solution of the Capacitated Vehicle Routing Problem

    Article • February 2011, Wiley

    Prof. Daniele Vigo

  33. Graph Sparsification for the Vehicle Routing Problem with Time Windows

    Article • January 2011, Springer Science + Business Media

    Prof. Daniele Vigo

  34. The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

    Article • Transportation Science, August 2010, INFORMS

    Prof. Daniele Vigo

  35. Exact algorithms for routing problems under vehicle capacity constraints

    Article • Annals of Operations Research, November 2009, Springer Science + Business Media

    Prof. Daniele Vigo

  36. Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs

    Article • Networks, August 2009, Wiley

    Prof. Daniele Vigo

  37. Recent advances in vehicle routing exact algorithms

    Article • 4OR, November 2007, Springer Science + Business Media

    Prof. Daniele Vigo

  38. Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

    Article • Transportation Science, November 2007, INFORMS

    Prof. Daniele Vigo

  39. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

    Article • Transportation Science, May 2007, INFORMS

    Prof Juan José Salazar González, Prof. Daniele Vigo

  40. Comments on: Static pickup and delivery problems: a classification scheme and survey

    Article • Top, April 2007, Springer Science + Business Media

    Prof. Daniele Vigo

  41. Algorithm 864

    Article • ACM Transactions on Mathematical Software, March 2007, ACM (Association for Computing Machinery)

    Prof. Daniele Vigo

  42. Route 2005: Recent advances in vehicle routing optimization

    Article • Networks, January 2007, Wiley

    Prof. Daniele Vigo

  43. Chapter 6 Vehicle Routing

    Article • January 2007, Elsevier

    Prof. Daniele Vigo

  44. Lower bounds and heuristics for the Windy Rural Postman Problem

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

    Prof. Daniele Vigo

  45. Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

    Article • Operations Research, August 2005, INFORMS

    Prof. Daniele Vigo

  46. TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems

    Article • Annals of Operations Research, October 2004, Springer Science + Business Media

    Prof. Daniele Vigo

  47. Models and Bounds for Two-Dimensional Level Packing Problems

    Article • Journal of Combinatorial Optimization, September 2004, Springer Science + Business Media

    Prof. Daniele Vigo

  48. The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

    Article • INFORMS Journal on Computing, November 2003, INFORMS

    Prof. Daniele Vigo

  49. An Exact Approach to the Strip-Packing Problem

    Article • INFORMS Journal on Computing, August 2003, INFORMS

    Prof. Daniele Vigo

  50. Models, relaxations and exact approaches for the capacitated vehicle routing problem

    Article • Discrete Applied Mathematics, November 2002, Elsevier

    Prof. Daniele Vigo

  51. Heuristic algorithms for the three-dimensional bin packing problem

    Article • European Journal of Operational Research, September 2002, Elsevier

    Prof. Daniele Vigo

  52. A lower bound for the non-oriented two-dimensional bin packing problem

    Article • Discrete Applied Mathematics, April 2002, Elsevier

    Prof. Daniele Vigo

  53. The Vehicle Routing Problem

    Article • January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  54. 1. An Overview of Vehicle Routing Problems

    Article • January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  55. 2. Branch-And-Bound Algorithms for the Capacitated VRP

    Article • January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  56. 8. VRP with Backhauls

    Article • January 2002, Society for Industrial & Applied Mathematics (SIAM)

    Prof. Daniele Vigo

  57. Exact and heuristic algorithms for data sets reconstruction

    Article • European Journal of Operational Research, July 2000, Elsevier

    Prof. Daniele Vigo

  58. The Three-Dimensional Bin Packing Problem

    Article • Operations Research, April 2000, INFORMS

    Prof. Daniele Vigo

  59. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

    Article • INFORMS Journal on Computing, November 1999, INFORMS

    Prof. Daniele Vigo

  60. Heuristics for the traveling salesman problem with pickup and delivery

    Article • Computers & Operations Research, July 1999, Elsevier

    Prof. Daniele Vigo

  61. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls

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

    Prof. Daniele Vigo

  62. Solving TSP through the Integration of OR and CP Techniques

    Article • Electronic Notes in Discrete Mathematics, March 1999, Elsevier

    Prof. Daniele Vigo

  63. Bin Packing Approximation Algorithms: Combinatorial Analysis

    Article • January 1999, Springer Science + Business Media

    Prof. Daniele Vigo

  64. Approximation algorithms for the oriented two-dimensional bin packing problem

    Article • European Journal of Operational Research, January 1999, Elsevier

    Prof. Daniele Vigo

  65. Neighborhood Search Algorithm for the Guillotine Non-Oriented Two-Dimensional Bin Packing Problem

    Article • January 1999, Springer Science + Business Media

    Prof. Daniele Vigo

  66. Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience

    Article • January 1999, Springer Science + Business Media

    Prof. Daniele Vigo

  67. A Survey of Optimization Models for Train Routing and Scheduling

    Article • Transportation Science, November 1998, INFORMS

    Prof. Daniele Vigo

  68. Exact Solution of the Two-Dimensional Finite Bin Packing Problem

    Article • Management Science, March 1998, INFORMS

    Prof. Daniele Vigo

  69. Exact Solution of the Vehicle Routing Problem

    Article • January 1998, Springer Science + Business Media

    Prof. Daniele Vigo

  70. Crew Scheduling and Rostering Problems in Railway Applications

    Article • January 1998, Springer Science + Business Media

    Prof. Daniele Vigo

  71. A tabu search algorithm for the Open Shop problem

    Article • Top, December 1997, Springer Science + Business Media

    Prof. Daniele Vigo

  72. Algorithms for railway crew management

    Article • Mathematical Programming, October 1997, Springer Science + Business Media

    Prof. Daniele Vigo

  73. Heuristic Algorithms for the Handicapped Persons Transportation Problem

    Article • Transportation Science, February 1997, INFORMS

    Prof. Daniele Vigo

  74. A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem

    Article • Networks, January 1997, Wiley

    Prof. Daniele Vigo

  75. A heuristic algorithm for the asymmetric capacitated vehicle routing problem

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

    Prof. Daniele Vigo

  76. Fast Local Search Algorithms for the Handicapped Persons Transportation Problem

    Article • January 1996, Springer Science + Business Media

    Prof. Daniele Vigo

  77. Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties

    Article • January 1996, Springer Science + Business Media

    Prof. Daniele Vigo

  78. A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls

    Article • January 1996, Springer Science + Business Media

    Prof. Daniele Vigo

  79. An exact algorithm for the capacitated shortest spanning arborescence

    Article • Annals of Operations Research, December 1995, Springer Science + Business Media

    Prof. Daniele Vigo

  80. Minimizing the sum of weighted completion times with unrestricted weights

    Article • Discrete Applied Mathematics, October 1995, Elsevier

    Prof. Daniele Vigo

  81. A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs

    Article • Operations Research, October 1994, INFORMS

    Prof. Daniele Vigo

  82. Routing a Heterogeneous Fleet of Vehicles

    Article • Springer Science + Business Media

    Prof. Daniele Vigo