Bi-sided facility location problems: an efficient algorithm for <i>k</i>-centre, <i>k</i>-median, and travelling salesman problems-Reference-Cited by-同舟云学术

Bi-sided facility location problems: an efficient algorithm for k-centre, k-median, and travelling salesman problems

Published:2023-07-18 Issue:1 Volume:10 Page:
ISSN:2330-2674
Container-title:International Journal of Systems Science: Operations & Logistics
language:en
Short-container-title:International Journal of Systems Science: Operations & Logistics

Author:

Davoodi Mansoor¹²³^ORCID,Rezaei Jafar³^ORCID

Affiliation:

1. Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran

2. Center for Advanced Systems Understanding (CASUS), Helmholtz-Zentrum Dresden Rossendorf (HZDR), Görlitz, Germany

3. Faculty of Technology, Policy and Management, Delft University of Technology, Delft, The Netherlands

Publisher

Informa UK Limited

Subject

Information Systems and Management,Management Science and Operations Research,Information Systems,Management Information Systems

Link

Reference94 articles.

2. Alijani, R., Banerjee, S., Gollapudi, S., Kollias, K. & Munagala, K. (2017). Bi-sided facility location. arXiv preprint arXiv:1711.11392.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献