✦ LIBER ✦

A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization

✍ Scribed by S. E. Karisch; E. Çela; J. Clausen; T. Espersen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds based on linear programming

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

A new lower bound for the quadratic assi

✍ S.I. Sergeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 549 KB

A new bound for the quadratic assignment

✍ Kurt M. Anstreicher; Nathan W. Brixius 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 114 KB

A branch-and-bound-based heuristic for s

✍ M. S. Bazaraa; O. Kirca 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 897 KB

A branch-and-bound algorithm for the qua

✍ Peter Hahn; Thomas Grant; Nat Hall 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 927 KB

A lower bound of 12n2 on linear search p

✍ David Dobkin; Richard J. Lipton 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 234 KB