✦ LIBER ✦

A new bound for the quadratic assignment problem based on convex quadratic programming

✍ Scribed by Kurt M. Anstreicher; Nathan W. Brixius

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 parametric-based heuristic program for

✍ D. J. White 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

A convex form of the quadratic assignmen

✍ Douglas J. White 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 552 KB

A branch-and-bound-based heuristic for s

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

Strengthening Gilmore's bound for the qu

✍ D.J. White 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 712 KB