Stronger path‐based extended formulation for the Steiner tree problem
Author:
Affiliation:
1. Fakultät für Mathematik, Technische Universität Chemnitz Chemnitz Germany
2. Center for Operations Research and Econometrics Université Catholique de Louvain Louvain‐la‐Neuve Belgium
Funder
Marie Curie ITN ‘MINO’ and P7/36 PAI project COMEX
Publisher
Wiley
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Link
https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21901
Reference29 articles.
1. Thek-Steiner Ratio in Graphs
2. Steiner Tree Approximation via Iterative Randomized Rounding
3. D.Chakrabarty J.Könemann andD.Pritchard “Hypergraphic LP relaxations for Steiner trees ” Integer Programming and Combinatorial Optimization Springer Berlin Heidelberg 2010 pp. 383–396.
4. M.ChlebíkandJ.Chlebíková Approximation hardness of the Steiner tree problem on graphs Algorithm Theory — SWAT 2002 Springer Berlin Heidelberg 2002 pp. 170–179.
5. Polyhedral Approaches for the Steiner Tree Problem on Graphs
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal connected subgraphs: Integer programming formulations and polyhedra;Networks;2022-05-23
2. Keywords-Driven Paper Recommendation Based on Mobile Edge Computing Environment Framework;Scientific Programming;2022-04-08
3. Finding Minimum Connected Subgraphs With Ontology Exploration on Large RDF Data;IEEE Transactions on Knowledge and Data Engineering;2022
4. Chvátal–Gomory cuts for the Steiner tree problem;Discrete Applied Mathematics;2021-03
5. Optimal Steiner trees under node and edge privacy conflicts;Journal of Combinatorial Optimization;2021-01-29
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3