✦ LIBER ✦

Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs

✍ Scribed by Pereira, Dilson Lucas; Gendreau, Michel; Salles da Cunha, Alexandre

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Improved heuristics for the bounded-diam

✍ Alok Singh; Ashok K. Gupta 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 423 KB

Tabu search with strategic oscillation f

✍ Lozano, Manuel; Glover, Fred; García-Martínez, Carlos; Rodríguez, Francisco Javi 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 161 KB

Local search for the minimum label spann

✍ Tobias Brüggemann; Jérôme Monnot; Gerhard J. Woeginger 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 220 KB

An Unconditional Lower Bound on the Time

✍ Elkin, Michael 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 330 KB

A branch and bound algorithm for the cap

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