Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem-Reference-Cited by-同舟云学术

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

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Published:1989-06 Issue:3 Volume:8 Page:129-135
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Miller D.L.,Pekny J.F.

Publisher

Elsevier BV

Subject

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

Reference25 articles.

1. Branch and bound methods;Balas,1985

2. Shortest Augmenting Path Algorithm for the Assignment Problem;Balas,1985

3. A Parallel Shortest Augmenting Path Algorithm for Fully Dense Linear Assignment Problems;Balas,1988

4. Pathology of traveling salesman subtour-elimination algorithms;Bellmore;Oper. Res.,1971

5. A distributed asynchronous relaxation algorithm for the assignment problem;Bertsekas,1987

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

1. Sine Cosine Algorithm for Discrete Optimization Problems;Sine Cosine Algorithm for Optimization;2023

2. Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms;Central European Journal of Operations Research;2018-08-17

3. SelfSplit parallelization for mixed-integer linear programming;Computers & Operations Research;2018-05

4. Parallel Solvers for Mixed Integer Linear Optimization;Handbook of Parallel Constraint Reasoning;2018

5. References;Extremal Optimization;2016-03-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP