A node-based ILP formulation for the node-weighted dominating Steiner problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A node-based ILP formulation for the node-weighted dominating Steiner problem

Published:2016-11-25 Issue:1 Volume:69 Page:33-51
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

Bley Andreas¹,Ljubić Ivana²,Maurer Olaf¹

Affiliation:

1. Department of Mathematics; Universitat Kassel; Kassel Germany

2. ESSEC Business School of Paris; Cergy-Pontoise France

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference23 articles.

1. The Maximum Weight Connected Subgraph Problem

2. On approximation problems related to the independent set and vertex cover problems;Bar-Yehuda;Discr Appl Math,1984

3. Imposing connectivity constraints in forest planning models;Carvajal;Oper Res,2013

4. On the spanning tree polyhedron;Chopra;Oper Res Lett,1989

5. The Steiner tree problem I: Formulations, compositions and extension of facets;Chopra;Math Program,1994

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem;Computers & Operations Research;2023-05

2. A branch-and-cut algorithm for the maximum covering cycle problem;Annals of Operations Research;2018-04-11

3. A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems;Computers & Operations Research;2017-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP