Reaching the elementary lower bound in the vehicle routing problem with time windows-Reference-Cited by-同舟云学术

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

Reaching the elementary lower bound in the vehicle routing problem with time windows

Published:2015-01 Issue:1 Volume:65 Page:88-99
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Contardo Claudio¹²,Desaulniers Guy²³,Lessard François²

Affiliation:

1. Département de management et technologie; ESG UQÀM, Montreal (Quebec); Canada

2. Groupe d'études et de recherche en analyse des décisions (GERAD), Montreal (Quebec); Canada

3. Département de mathématiques et de génie industriel; École Polytechnique de Montréal, Montreal (Quebec); Canada

Funder

Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada

Publisher

Wiley

Subject

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

Reference19 articles.

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

2. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints;Baldacci;Eur J Oper Res,2012

3. Branch-and-price: Column generation for solving huge integer programs;Barnhart;Oper Res,1998

4. Accelerated label setting algorithms for the elementary resource constrained shortest path problem;Boland;Oper Res Lett,2006

5. An exact algorithm based on cut and column generation for the capacitated location-routing problem;Contardo;INFORMS J Comput,2014

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

1. The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph;INFORMS Journal on Computing;2024-09-02

2. Optimization of machine schedules and vehicle routes in the mobile additive manufacturing mode;International Journal of Production Research;2024-07-22

3. Optimizing Carbon Emissions in Green Logistics for Time-Dependent Routing;2024

4. Machine-Learning–Based Arc Selection for Constrained Shortest Path Problems in Column Generation;INFORMS Journal on Optimization;2023-04

5. The Fragility-Constrained Vehicle Routing Problem with Time Windows;Transportation Science;2023-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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