Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming-Reference-Cited by-同舟云学术

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

Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming

Published:1984-12 Issue:6 Volume:32 Page:1381-1384
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Byers Thomas H.,Waterman Michael S.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Link

https://pubsonline.informs.org/doi/pdf/10.1287/opre.32.6.1381

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

1. Optimization problems with evidential linear objective;International Journal of Approximate Reasoning;2023-10

2. On Modelling and Solving the Shortest Path Problem with Evidential Weights;Belief Functions: Theory and Applications;2022

3. Sustainable Transport in the Supply Chain Using Dijkstra Algorithm, Branch & Bound, and Dynamic Programming;Springer Proceedings in Materials;2022

4. Most Diverse Near-Shortest Paths;Proceedings of the 29th International Conference on Advances in Geographic Information Systems;2021-11-02

5. A Model for Tacit Communication in Collaborative Human-UAV Search-and-Rescue;Entropy;2021-08-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP