Combinatorial Route Optimization

Branch and Cut

An exact combinatorial optimization method that combines implicit enumeration (Branch and Bound) with cutting plane techniques to tighten the linear relaxation of the problem and accelerate resolution.

← Indietro