Search
Skip to Search Results
Filter
Subject / Keyword
- 2Combinatorial Optimization
- 1Approximation Algorithm
- 1Approximation Algorithms
- 1Column Generation
- 1DCVR
- 1DCVRP
Author / Creator / Contributor
Year
Collections
Languages
Item type
Departments
-
Fall 2011
In this thesis, we present a variety of approximation algorithms for the Unsplittable Flow on Paths problem and some Traveling Salesman problems. The main contribution to the Unsplittable Flow on Paths problem is a logarithmic approximation algorithm which is the first non-trivial approximation...
-
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