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
Filter
Author / Creator / Contributor
Subject / Keyword
- 1algorithms
- 1approximation algorithms
- 1bounded treewidth
- 1doubling dimension
- 1graphs
- 1highway dimension
Year
Collections
Languages
Item type
Departments
Supervisors
-
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
DownloadFall 2021
In this thesis, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser in 1959, we are given a graph G = (V,E) with metric edges costs, a depot r in V , and a vehicle of bounded capacity Q. The goal...
1 - 1 of 1