✦ LIBER ✦

Lower Bounds from Tile Covers for the Channel Assignment Problem

✍ Scribed by Janssen, J. C. M.; Wentzell, T. E.; Fitzpatrick, S. L.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the channel assign

✍ Smith, D.H.; Hurley, S.; Allen, S.M. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 207 KB

Improved Lower Bounds for the Quadratic

✍ S. I. Sergeev 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 176 KB

Lower bounds for the quadratic semi-assi

✍ Federico Malucelli; Daniele Pretolani 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Lower bounds for the quadratic assignmen

✍ Stefan E. Karisch; Franz Rendl 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 686 KB

Upper and lower bounds for the fixed spe

✍ Roberto Montemanni 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 41 KB

Lower bounds based on linear programming

✍ Zvi Drezner 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 268 KB