Author:
Wang Yang,Lü Zhipeng,Glover Fred,Hao Jin-Kao
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Alidaee, B., Kochenberger, G.A., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. International Journal of Systems Science 25, 401–408 (1994)
2. Amini, M., Alidaee, B., Kochenberger, G.A.: A scatter search approach to unconstrained quadratic binary programs. In: New Methods in Optimization, pp. 317–330. McGraw-Hill, New York (1999)
3. Beasley, J.E.: Obtaining test problems via internet. Journal of Global Optimization 8, 429–433 (1996)
4. Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Working Paper, The Management School, Imperial College, London, England (1998)
5. Benlic, U., Hao, J.K.: A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Transactions on Evolutionary Computation 15(5), 624–642 (2011)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献