✦ LIBER ✦

The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

✍ Scribed by Martinez, Leonardo Conegundes; da Cunha, Alexandre Salles

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Min-degree constrained minimum spanning

✍ Ana Maria de Almeida; Pedro Martins; Maurício C. de Souza 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 671 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

A LEARNING AUTOMATA-BASED ALGORITHM TO T

✍ TORKESTANI, JAVAD AKBARI 📂 Article 📅 2013 🏛 World Scientific Publishing Company 🌐 English ⚖ 365 KB

The generalized minimum spanning tree pr

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

Lower and upper bounds for the degree-co

✍ Alexandre Salles da Cunha; Abilio Lucena 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

The Degree Preserving Spanning Tree Prob

✍ Gendron, Bernard; Lucena, Abilio; Salles da Cunha, Alexandre; Simonetti, Luidi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 169 KB