A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints

Mads Kehlet Jepsen, Bjørn Petersen, Simon Spoorendonk

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    Abstract

    The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem of the capacitated vehicle routing problem and the latter is for the split delivery version.
    Original languageEnglish
    Publication date2010
    Publication statusPublished - 2010
    EventOptimization Days 2010 - Montréal, Canada
    Duration: 10 May 201012 May 2010
    http://w1.cirrelt.ca/jopt2010/en/

    Conference

    ConferenceOptimization Days 2010
    Country/TerritoryCanada
    CityMontréal
    Period10/05/201012/05/2010
    Internet address

    Fingerprint

    Dive into the research topics of 'A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints'. Together they form a unique fingerprint.

    Cite this