Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:pure.atira.dk:publications/dd816da9-64fe-4d0b-ae30-eb7f8e9db934

Shortest Paths and Vehicle Routing

Authors
Publication date
1 January 2011
Publisher
DTU Management

Abstract

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

Similar works

Full text

thumbnail-image

Online Research Database In Technology

redirect
oaioai:pure.atira.dk:publications...
Last time updated on 22/08/2013

This paper was published in Online Research Database In Technology.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.