Author:
Kochenberger Gary A.,Hao Jin-Kao,Lü Zhipeng,Wang Haibo,Glover Fred
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software
Reference12 articles.
1. Boros, E., Hammer, P.: The Max-Cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33, 151–180 (1991)
2. Burer, S., Monteiro, D., Zang, Y.: Rank-two relaxation heuristic for Max-Cut and other binary quadratic programs. SIAM J. Optim. 12, 503–521 (2001)
3. Choi, C., Ye, Y.: Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Working Paper, Department of Management Sciences, The University of Iowa (2000)
4. Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 7, 1033–1058 (2002)
5. Glover, F., Lü, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR, Q. J. Oper. Res. (2010). doi: 10.1007/s10288-009-0115-y
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献