Search
Skip to Search Results
Filter
Subject / Keyword
Author / Creator / Contributor
Year
Collections
Languages
Item type
Departments
-
Fall 2016
In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main contribution is a framework to build good constant-factor approximation algorithms for variants of the multi-depot $k$-travelling...
-
Solving the LP Relaxation of Distance-Constrained Vehicle Routing Problem Using Column Generation
DownloadFall 2020
The distance-constrained vehicle routing problem (DVRP) is one of the less studied variants of vehicle routing problems. Here, the objective is to deliver packages from a depot to clients with as few delivery vehicles as possible within a given time frame. In this thesis, we tackle larger...
1 - 2 of 2