| 联合补充博弈的费用分摊 |
| |
| 引用本文： | 姜春艳,苏国强,闫肖丽.联合补充博弈的费用分摊[J].中国人民武装警察部队学院学报,2010,26(8):91-94. |
| |
| 作者姓名： | 姜春艳 苏国强 闫肖丽 |
| |
| 作者单位： | [1]武警学院基础部,河北廊坊065000 [2]北京工业大学数理学院,北京100124 |
| |
| 摘 要： | 就一个仓库、多个零售商,对联合订货费用函数的模型进行分析,给出了一个求解最佳订货周期的多项式时间的算法,且算法的时间复杂性为O（nlogn）。利用文献8]中的技巧,给出了该库存博弈的核。
|
| 关 键 词： | 库存博弈 核 多项式时间 |
Cost Allocation for Joint Replenishment Models |
| |
| JIANG Chun-yan,SU Guo-qiang,YAN Xiao-li.Cost Allocation for Joint Replenishment Models[J].Journal of the Chinese People's Armed Police Force Academy,2010,26(8):91-94. |
| |
| Authors: | JIANG Chun-yan SU Guo-qiang YAN Xiao-li |
| |
| Institution: | 1.Basic Courses Teaching Department,The Armed Police Academy,Langfang,Hebei Province 065000,China;2.Department of Applied Mathematics,Beijing University of Technology,Beijing 100124,China) |
| |
| Abstract: | We consider the one warehouse multiple retailers inventory model.This paper gives a polynomial time algorithm for solving the optimal order cycle,and the algorithm＇s time complexity is O（nlogn）.Using Zhang＇s technique8],we give the core of this inventory game. |
| |
| Keywords: | inventory game core polynomial time |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
