could you possibly answer a question about Gurobi's heuristics with regards to the set covering problem?
I solve instances for the most basic set covering problems, every possible location has the same opening cost and every customer has to be served by at least one location.
When I start the model, Gurobi finds a heuristic and even before initiating the simplex algorithm the objective value of the current solution is very close to optimum.
Can you recommend any books, research papers or other resources that describe how the heuristic operates? I tried using a simple heuristic that opens locations, which serve the most customers but it performs poorly compared to Gurobi.
Thank you in advance, I would really appreciate any help.
Please sign in to leave a comment.