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

Publication: ResearchConference abstract for conference – Annual report year: 2010

View graph of relations

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
StatePublished - 2010

Conference

ConferenceOptimization Days 2010
CountryCanada
CityMontréal
Period10/05/201012/05/2010
Internet addresshttp://w1.cirrelt.ca/jopt2010/en/
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 4355576