Thesis Università degli studi di Milano, 2006

Branch-and-price algorithms for vehicle routing problems

Matteo Salani

Paper

Abstract

This doctoral thesis develops branch-and-price algorithms for vehicle routing problems. It presents efficient dynamic programming-based pricing routines for the elementary shortest path problem with resource constraints, and integrates them within branch-and-bound frameworks to solve various vehicle routing problem variants to optimality.

Vehicle RoutingBranch and PriceDynamic Programming

BibTeX

@phdthesis{salani2006branch,
  title={Branch-and-price algorithms for vehicle routing problems},
  author={Salani, Matteo},
  year={2006},
  school={Universit{\`a} degli studi di Milano}
}