Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems-Reference-Cited by-同舟云学术

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

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems

Published:2023-06 Issue: Volume:960 Page:113923
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chlebíková Janka,Dallard Clément^ORCID,Paulsen Niklas

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Maximum directed cuts in acyclic digraphs;Alon;J. Graph Theory,2007

2. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications;Atallah;Algorithmica,1995

3. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999

4. Complexity of scheduling for DARP with soft ride times;Chlebíková,2019

5. The dial-a-ride problem (DARP): variants, modeling issues and algorithms;Cordeau;4OR,2003

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP