.png){kind=icon}
返回
The Continuous-Time Inventory-Routing Problem
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.2019.0902.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a continuous-time variant of the inventory-routing problem in which the maximum quantity that can delivered to a customer depends on the customer's storage capacity and product inventory at the time of the delivery. We investigate critical components of a dynamic discretization discovery algorithm and demonstrate in an extensive computational study that these components are sufficient to produce provably high-quality, often optimal solutions.
Keyword:
inventory routing
time-expanded network
mixed integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
Adenosine A1-receptor coupling to phosphoinositide metabolism in pregnant guinea pig myometrium
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容