Author:
Drezner Zvi,Hahn Peter M.,Taillard Éeric D.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference62 articles.
1. Adams, W. et al. (2003). “A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization Technique.” OPIM Department Report No. 03-05-06, The Wharton School, University of Pennsylvania.
2. Adams, W. and H. Sherali. (1986). “A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems.” Management Science, 32(10), 1274–1290.
3. Adams, W. and H. Sherali. (1990). “Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems.” Operations Research 38, 217–226.
4. Ahuja, R.K., J.B. Orlin, and A. Tiwari. (2000). “A Descent Genetic Algorithm for the Quadratic Assignment Problem.” Computers and Operations Research 27, 917–934.
5. Angel, E. and V. Zissimopoulos. (2001). “On the Landscape Ruggedness of the Quadratic Assignment Problem.” Theoretical Computer Science 263, 159–172.
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献