.png){kind=icon}
.png){kind=icon}
Return
Solving resource constrained shortest path problems with LP-based methods
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2016.04.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the resource constrained shortest path problem (RCSPP) there is a directed, graph along with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements from a set of resource types with finite capacities. A minimum cost source-destination directed path is sought such that the total consumption of the arcs from each resource type does not exceed the capacity of the resource. In this paper we investigate LP-based branch-and-bound methods and introduce new cutting planes, separation procedures, variable fixing, and primal heuristic methods for solving RCSPP to optimality. We provide detailed computational experiments, and a comparison to other methods in the literature. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Resource constrained shortest path
Integer programming
Branch-and-cut
Primal heuristics
Combinatorial optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W