An exact bidirectional pulse algorithm for the constrained shortest path-Reference-Cited by-同舟云学术

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

An exact bidirectional pulse algorithm for the constrained shortest path

Published:2020-06-21 Issue:2 Volume:76 Page:128-146
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks.

Author:

Cabrera Nicolás¹,Medaglia Andrés L.¹^ORCID,Lozano Leonardo²,Duque Daniel³^ORCID

Affiliation:

1. Industrial Engineering Department Universidad de los Andes Bogotá Colombia

2. Operations, Business Analytics and Information Systems University of Cincinnati Cincinnati Ohio USA

3. Industrial Engineering and Management Sciences Northwestern University Evanston Illinois USA

Funder

Office of Naval Research Global

Universidad de los Andes

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21960

Reference34 articles.

1. 9th DIMACSImplementation Challenge—Shortest Paths.http://users.diag.uniroma1.it/challenge9/. Accessed: July 8 2019.

2. Exact Solution of the Evasive Flow Capturing Problem

3. Solving Real-World Linear Programs: A Decade and More of Progress

4. Acceleration strategies for the weight constrained shortest path problem with replenishment

5. The network design problem with relays

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

1. A bidirectional branch-and-price algorithm with Pulse procedure for the Electric Vehicle Routing Problem with flexible deliveries;Transportation Research Part C: Emerging Technologies;2024-08

2. Boosting existing shortest path algorithms through highly efficient building of node cut set-based overlay;Expert Systems with Applications;2024-08

3. A two-stage method for doubly resource constrained elementary shortest path problems;Knowledge-Based Systems;2024-06

4. A discrete Jaya algorithm for vehicle routing problems with uncertain demands;Systems Science & Control Engineering;2024-05-08

5. Reliable Routing Strategies on Urban Transportation Networks;Transportation Science;2024-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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