Publication: Research › Ph.d. thesis – Annual report year: 2011
This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown.
|Publication date||Jan 2011|
|Place of publication||Kgs. Lyngby|
|Number of pages||232|
- Chvátal-Gomory rank-1 cuts, Vehicle Routing Problems, Branch-and-Cut, Elementary Shortest Path Problems with Resource Constrains, Branch-Price-and-Cut, Dantzig-Wolfe decomposition
No data available