✦ LIBER ✦

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

✍ Scribed by Eduardo Uchoa; Ricardo Fukasawa; Jens Lysgaard; Artur Pessoa; Marcus Poggi de Aragão; Diogo Andrade

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the cap

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

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

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