期刊文献+

A Cost-Sharing Scheme for the k-Level Facility Location Game with Penalties

原文传递
导出
摘要 In the k-level facility location problem with penalties,each client will be either serviced or rejected completely.And if the client is planned to be serviced,then it must be connected to a sequence of k different kinds of facilities located in k levels of hierarchy.The total cost including the facility cost,connection cost and penalty cost will be jointly paid by all the clients.In the corresponding game of the k-level facility location problem with penalties,called the k-level facility location game with penalties,the total cost should be allocated to different clients.This work set out a cost-sharing scheme for the k-level facility location game with penalties that is cross-monotonic,competitive,and the approximate cost recovery is 6.
出处 《Journal of the Operations Research Society of China》 EI CSCD 2022年第1期173-182,共10页 中国运筹学会会刊(英文)
基金 This research was supported by the National Natural Science Foundation of China(Nos.11901544 and 11801251).
  • 相关文献

参考文献2

二级参考文献35

  • 1Xu, D., Du, D. The k-level facility location game. Operations Research Letters, 34(4): 421-426 (2006).
  • 2Xu, D., Zhang, S. Approximation algorithm for facility location with service installation costs. Operations Research Letters, 36(1): 46-50 (2008).
  • 3Zhang, J. Approximating the two-level facility location problem via a quasi-greedy approach, Mathematical Programming, 108(1): 159-176 (2006).
  • 4Zhang, J., C-hen, B., Ye, Y. A multiexehange local search algorithm for the capacitated facility location problem, Mathematics of Operations Research, 30(2): 389 403 (2005).
  • 5Zhang, J., Ye, Y. A note on the maximization version of the multi-level facility location problem. Operations Research Letters, 30(5): 333-335 (2002).
  • 6Aardal, K., Chudak, F., Shmoys, D. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters, 72:161-167 (1999).
  • 7Ageev, A., Ye, Y., Zhang, J. Improved combinatorial apporximation algorithms for the k-level tacility location problem. SIAM Journal on Discrete Mathematics, 18(1): 207- 217 (2004).
  • 8Byrka, J. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, in Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2007, 29-43.
  • 9Chudak, F., Shmoys, D. Improved approxiamtion algorithms for the uncapaciteted facility location problem. SIAM Journal on Computing, 33(1): 1-25 (2003).
  • 10Guha, S., Khuller, S. Greedy strike back: Improved facility location algorithms. Journal of Algorithms, 31:228-248 (1999).

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部