Istituto di Scienza e Tecnologie dell'Informazione     
Gallo G. A new branch and bound algorithm for the network design problem. In: The Optimization Day (Montreal, Maggio 1981). Proceedings, pp. 1 - 22. 1981.
A Branch and Bound algorithm is presented to solve the Network Design Problem. This algorithm makes use of new upper and lower bounds which are sharper than the ones used in previous algorithms of the same type. The results of a rather wide numerical experimentation are illustrated.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional