Treffer: An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints
Title:
An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints
Authors:
Wang, Bo-RuiAff1, Aff2, Chen, Wei-KunAff3, IDs10898025014963_cor1, Zhang, Yu-HaiAff4, Aff5, Yuan, Jian-HuaAff1, Aff2, Dai, Yu-HongAff4, Aff5
Source:
Journal of Global Optimization: An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering. :1-27
Database:
Springer Nature Journals