P

Initializing...

Eq. (11.59), the iterated optimal tour partition bound: for every customer tour some partition into consecutive routes costs at most $2\ell\bar c + (1 - \ell/n)\,z(\Gamma)$, $\ell = \lceil n/C \rceil$ · Prove2Me