.png){kind=icon}
返回
The rural postman problem with deadline classes
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00090-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle are-routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem. (C) 1998 Elsevier Science B.V.
Keyword:
rural postman problem
time windows
integer programming
cutting-planes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容