A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem

Alain Faye, Frédéric Roupin. A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. In Gerth Stølting Brodal, Stefano Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3669 of Lecture Notes in Computer Science, pages 850-861, Springer, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.