Partial Path Column Generation for the ESPPRC

Mads Kehlet Jepsen (Invited author), Bjørn Petersen (Invited author)

    Research output: Contribution to conferenceConference abstract for conferenceResearch


    This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing algorithms. We show that the algorithm for many instances outperforms a bidirectional labeling algorithm.
    Original languageEnglish
    Publication date2009
    Publication statusPublished - 2009
    EventThe 20th International Symposium of Mathematical Programming - Chicago, US
    Duration: 1 Jan 2009 → …
    Conference number: 20


    ConferenceThe 20th International Symposium of Mathematical Programming
    CityChicago, US
    Period01/01/2009 → …

    Cite this