.png){kind=icon}
返回
The Steiner cycle polytope
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00359-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article introduces a new problem called Steiner cycle problem (SCP), closely related to the widely-studied travelling salesman problem (TSP) and the Steiner tree problem. Given an undirected graph G with a penalty associated to each node and a cost to each edge, and given a subset of nodes W, the problem consists on finding a simple cycle in G visiting at least the nodes in Wand minimizing the sum of the costs of edges in the cycle plus the penalties of nodes not in the cycle. This problem finds applications in the optimal design of telecommunication systems, and generalizes the known TSP and the weighted Girth problem. We analyze the polyhedral structure associated to the SCP introducing two lifting procedures to extend facet-defining inequalities from the travelling salesman polytope. The obtained results can be applied to the weighted Girth problem. Moreover, they can also be used in a cutting-plane approach to solve the SCP. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
polyhedra
facets
Steiner trees
travelling salesman
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容