APA (7th ed.) Citation

Wang, B., Chen, W., Zhang, Y., Yuan, J., & Dai, Y. (2025, May 12). An efficient branch-and-cut algorithm for the minimum covering location problem with distance constraints. Journal of global optimization. https://doi.org/10.1007/s10898-025-01496-3

Chicago Style (17th ed.) Citation

Wang, Bo-Rui, Wei-Kun Chen, Yu-Hai Zhang, Jian-Hua Yuan, and Yu-Hong Dai. "An Efficient Branch-and-cut Algorithm for the Minimum Covering Location Problem with Distance Constraints." Journal of Global Optimization 12 May. 2025. https://doi.org/10.1007/s10898-025-01496-3.

MLA (9th ed.) Citation

Wang, Bo-Rui, et al. "An Efficient Branch-and-cut Algorithm for the Minimum Covering Location Problem with Distance Constraints." Journal of Global Optimization, 12 May. 2025, https://doi.org/10.1007/s10898-025-01496-3.