✦ LIBER ✦

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut

✍ Scribed by Feremans Corinne; Labbé Martine; Laporte Gilbert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized minimum spanning tree pr

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

A branch and cut method for the degree-c

✍ L. Caccetta; S.P. Hill 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

Branch-and-cut and hybrid local search f

✍ Eduardo Uchoa; Túlio A. M. Toffolo; Mauricio C. de Souza; Alexandre X. Martins; 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

On the generalized minimum spanning tree

✍ Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

Robust branch-cut-and-price for the Capa

✍ Eduardo Uchoa; Ricardo Fukasawa; Jens Lysgaard; Artur Pessoa; Marcus Poggi de Ar 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 318 KB

A branch and bound algorithm for the cap

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB