When does the greedy beat the solver? A computational study of an obnoxious facility location problem, benchmarking CBC against a greedy heuristic across 60 instances. Reveals a difficulty cliff driven by covering density.
python optimization operations-research pulp integer-programming mixed-integer-programming facility-location mathematical-modeling cbc-solver computational-study
-
Updated
Sep 17, 2026 - Jupyter Notebook