Richiedi una copia del documento: Relation between computational complexity and integrality gap in branch-and-bound-based methods: the case of the Travelling Salesman Problem

Captcha code
Annulla