Tight lower bounds for the Traveling Salesman Problem with draft limits-Reference-Cited by-同舟云学术

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

Tight lower bounds for the Traveling Salesman Problem with draft limits

Published:2023-06 Issue: Volume:154 Page:106196
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Balma Ali^ORCID,Mrad Mehdi,Ladhari Talel

Funder

National Plan for Science, Technology and Innovation

King Abdulaziz City for Science and Technology

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference28 articles.

1. The time dependent traveling salesman problem: polyhedra and algorithm;Abeledo;Math. Program. Comput.,2013

2. A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping;Arnesen;Comput. Oper. Res.,2017

3. A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing);Ascheuer;SIAM J. Optim.,1993

4. Polyhedral theory for the asymmetric traveling salesman problem;Balas,2007

5. Allocating nodes to hubs for minimizing the hubs processing resources: A case study;Balma;RAIRO-Oper. Res.,2019

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

1. Deep clustering of the traveling salesman problem to parallelize its solution;Computers & Operations Research;2024-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP