D&C and Knuth can combine with other techniques. Example: D&C improvement inside a segment tree for online queries.
Or: Knuth improvement for the core DP, then binary search for the answer over a parameter. These combinations are rare in contests but effective. Understand each technique deeply before combining. Learn single optimizations first. Combinations are advanced competitive programming territory.