The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm-Reference-Cited by-同舟云学术

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

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

Published:2004-01-15 Issue:2 Volume:43 Page:71-86
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Feremans Corinne,Labbé Martine,Laporte Gilbert

Funder

Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture

Région Bruxelles-Capitale

Direction générale des Relations Extérieures de la Région wallonne de Belgique

Canadian Natural Sciences 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.10105/fullpdf

Reference26 articles.

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

2. Generalized spanning trees;Dror;Eur J Oper Res,2000

3. Matroids and the greedy algorithm;Edmonds;Math Program,1971

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

1. An Adaptive Multi-Meme Memetic Algorithm for the prize-collecting generalized minimum spanning tree problem;Swarm and Evolutionary Computation;2024-10

2. An Adaptive Multi-Meme Memetic Algorithm for the Prize-Collecting Generalized Minimum Spanning Tree Problem;2024

3. Continuous approximation formulas for location problems;Networks;2022-04-29

4. The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis;Journal of Optimization Theory and Applications;2020-11-27

5. An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search;International Transactions in Operational Research;2020-10-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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