Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints-Reference-Cited by-同舟云学术

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

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

Published:2008-12-17 Issue:2 Volume:53 Page:141-159
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Costa Alysson M.,Cordeau Jean-François,Laporte Gilbert

Funder

Brazilian Federal Agency for Post-Graduate Education-CAPES

Canadian Natural Science and Engineering Research Council

Publisher

Wiley

Subject

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

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.20274/fullpdf

Reference40 articles.

1. OR-Library: Distributing test problems by electronic mail;Beasley;J Oper Res Soc,1990

2. A note on the prize collecting traveling salesman problem;Bienstock;Math Program,1993

3. Local search with perturbations for the prize-collecting Steiner tree problem in graphs;Canuto;Networks,2001

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

5. The Steiner tree problem. II. Properties and classes of facets;Chopra;Math Program,1994

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

1. Digestive system and feeding of deep-sea acorn worm Quatuoralisia malakhovi (Enteropneusta: Torquaratoridae) from the Bering sea;Deep Sea Research Part I: Oceanographic Research Papers;2024-01

2. Metrics for Quantifying Shareability in Transportation Networks: The Maximum Network Flow Overlap Problem;Transportation Research Part C: Emerging Technologies;2024-01

3. MIP formulations for induced graph optimization problems: a tutorial;International Transactions in Operational Research;2023-04-17

4. Exact algorithms for budgeted prize-collecting covering subgraph problems;Computers & Operations Research;2022-08

5. New formulations and branch-and-cut procedures for the longest induced path problem;Computers & Operations Research;2022-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3