I'm struggling with this question for weeks:
What is the main difference between the role of computation lower bounds for exact methods, heuristics, and hybrid of exact and heuristics?
I try to answer that by saying:
Lower bound for exact methods is "an aid tool" to solve the problem but not an independent solution tool. While for heuristics methods, it is "a measuring tool" for the quality of the solution. Is that right?
What about the hybrid of exact and heuristics methods?
I need references to understand the difference.