Solving the park-and-loop routing problem by branch-price-and-cut-Reference-Cited by-同舟云学术

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

Solving the park-and-loop routing problem by branch-price-and-cut

Published:2023-12 Issue: Volume:157 Page:104369
ISSN:0968-090X
Container-title:Transportation Research Part C: Emerging Technologies
language:en
Short-container-title:Transportation Research Part C: Emerging Technologies

Author:

Cabrera Nicolás^ORCID,Cordeau Jean-François,Mendoza Jorge E.^ORCID

Funder

CRSNG

Canada First Research Excellence Fund

Healthcare Excellence Canada

Institut de Valorisation des Données

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Transportation,Automotive Engineering,Civil and Structural Engineering

Reference41 articles.

1. Exact solution of the evasive flow capturing problem;Arslan;Oper. Res.,2018

2. New route relaxation and pricing strategies for the vehicle routing problem;Baldacci;Oper. Res.,2011

3. A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots;Belenguer;Transp. Sci.,2016

4. Acceleration strategies for the weight constrained shortest path problem with replenishment;Bolívar;Optim. Lett.,2014

5. The doubly open park-and-loop routing problem;Cabrera;Comput. Oper. Res.,2022

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

1. A heuristic-based benders decomposition for the hybrid relief distribution network minimizing deprivation cost of vulnerable areas;Kybernetes;2024-03-22

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP