Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits-Reference-Cited by-同舟云学术

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

Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits

Published:2024-12 Issue:3 Volume:319 Page:793-807
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Li Jiaojiao,Zhu Jianghan,Peng Guansheng,Wang Jianjiang^ORCID,Zhen Lu,Demeulemeester Erik^ORCID

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Reference47 articles.

1. Team orienteering problem with decreasing profits;Afsar;Electronic Notes in Discrete Mathematics,2013

2. An exact algorithm for the pickup and delivery problem with time windows;Baldacci;Operations Research,2011

3. A branch-and-cut algorithm for the team orienteering problem;Bianchessi;International Transactions in Operational Research,2018

4. A heuristic for the multiple tour maximum collection problem;Butt;Computers & Operations Research,1994

5. Solving an integrated logistics problem arising in grocery distribution;Carter;INFOR: Information Systems and Operational Research,1996

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP