Cross-Entropy Method for the Maximal Covering Location Problem
Published Online:11 Mar 2025https://doi.org/10.1287/ijoc.2024.0611
Volume 38, Issue 1
January-February 2026
Pages iv-xvi, 1-339, iii
Article Information
Supplemental Material
Metrics
Information
- Received:January 31, 2024
- Accepted:February 14, 2025
- Published Online:March 11, 2025
Copyright © 2025, INFORMS
Cite as
Hongtao Wang, Jian Zhou (2025) Cross-Entropy Method for the Maximal Covering Location Problem. INFORMS Journal on Computing 38(1):253-268.
https://doi.org/10.1287/ijoc.2024.0611
Keywords
The authors thank the anonymous referees for careful and insightful comments, which led to a stronger manuscript; Pingke Li from Tsinghua University; Instituto Tecnológico de Informática for the computational support; and all the relevant editors, reviewers, and other contributors during publication. Detailed computational results within the paper are available as online supplements, and data and codes are accessible at the accompanying GitHub repository (Wang and Zhou 2025) and https://github.com/HWangUPV/MCLP.
