Combinatorial Route Optimization

Linear Relaxation

A technique used in exact methods where the integrality constraints of a combinatorial optimization problem are relaxed to obtain a lower bound on the optimal value of the objective function.

← Wstecz