This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 3Orienteering
- 1Algorithm
- 1Approximation
- 1Approximation Algorithm
- 1Approximation Schemes
- 1Capacitated
-
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...
-
Fall 2024
In this thesis we consider the point to point orienteering and deadline traveling salesman problems on graphs with bounded treewidth and graphs with consant doubling dimension and present approximation schemes for them. These are extensions of the classic Traveling Salesman Problem (TSP). Suppose...
-
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...