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

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

  • Published:2003-05 Issue:3 Volume:31 Page:185-194
  • ISSN:0167-6377
  • Container-title:Operations Research Letters
  • language:en
  • Short-container-title:Operations Research Letters

Author:

Ahuja Ravindra K.,Orlin James B.,Sharma Dushyant

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference14 articles.

1. Data Structures and Algorithms;Aho,1983

2. Network Flows: Theory, Algorithms and Applications;Ahuja,1993

3. Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem;Ahuja;Math. Program.,2001

4. Capacitated minimum spanning trees;Amberg;Combin. Optim. Theory Practice,1996

5. On teleprocessing system design. Part II—a method for approximating the optimal network;Esau;IBM Systems J.,1966

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

1. Distributed Neighborhood Search Algorithm for Target Assignment;2024 European Control Conference (ECC);2024-06-25

2. Scatter search for capacitated minimum spanning tree;Advances in Engineering Software;2023-12

3. A GPU Parallel Algorithm for Finding a Negative Subset Disjoint Cycle in a Graph;2023 IEEE High Performance Extreme Computing Conference (HPEC);2023-09-25

4. A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem;Computers & Operations Research;2022-08

5. Design of capacitated degree constrained min-sum arborescence;OPSEARCH;2022-06-27
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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