A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures-Reference-Cited by-同舟云学术

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

A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures

Published:1994-11 Issue:4 Volume:28 Page:292-308
ISSN:0041-1655
Container-title:Transportation Science
language:en
Short-container-title:Transportation Science

Author:

Habbal Mayiz B.,Koutsopoulos Haris N.,Lerman Steven R.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/trsc.28.4.292

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

1. A novel approach for modeling order picking paths;Naval Research Logistics (NRL);2020-12-08

2. Efficient Execution of Dynamic Programming Algorithms on Apache Spark;2020 IEEE International Conference on Cluster Computing (CLUSTER);2020-09

3. Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers;Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization;2020-02-21

4. A parallel computing framework for solving user equilibrium problem on computer clusters;Transportmetrica A: Transport Science;2020-01-01

5. Spectral clustering-based community detection using graph distance and node attributes;Computational Statistics;2019-07-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP