36
2. Discrete Relaxation
• Discrete relaxation is an alternative to (or addition
to)
the interpretation tree search.
• Relaxation is an iterative technique with polynomial
time complexity.
• Relaxation uses local constraints at each iteration.
• It can be implemented on parallel machines.