.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Resource constrained shortest path
Integer programming
Branch-and-cut
Primal heuristics
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。