Presolving and cutting planes for the generalized maximal covering location problem

Documenti analoghi

• An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
  di: Wang, Yan-Ru, et al.
  Pubblicazione: (2025)
• An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
  di: Chen, Wei-Kun, et al.
  Pubblicazione: (2024)
• An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
  di: Guo, Yu-Qi, et al.
  Pubblicazione: (2025)
• Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
  di: Lv, Wei, et al.
  Pubblicazione: (2024)
• Hub location problems with asymmetric allocation
  di: Espejo, I., et al.
  Pubblicazione: (2026)