.png){kind=icon}
返回
An efficient optimal solution method for the joint replenishment problem
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(96)00072-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumerative approach and was computationally prohibitive. In this paper we present an alternative optimal approach based on global optimisation theory. By applying Lipschitz optimisation one can find a solution with an arbitrarily small deviation from an optimal value. An efficient procedure is presented which uses a dynamic Lipschitz constant and generates a solution in little time. The running time of this procedure grows only linearly in the number of items. (C) 1997 Elsevier Science B.V.
Keyword:
inventory
joint replenishment
multi-item
global optimisation
Lipschitz optimisation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容