Content deleted Content added
→Branch and bound for exact solutions: more explicit about subproblem variables |
→References: link fractional coloring |
||
Line 46:
Although it is difficult to prove theoretical bounds on the performance of algorithms of this type, they can be very effective in practice.
==See also==
* [[Fractional coloring]], the linear programming relaxation of [[graph coloring]].
==References==
| |||