Author:
Zhou Ying,Kong Lingjing,Yan Lijun,Liu Shaopeng,Hong Jiaming
Publisher
Springer International Publishing
Reference21 articles.
1. Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58–81 (2014). https://doi.org/10.1007/s10878-014-9734-0
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
3. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)
4. Anacleto, E.A., Meneses, C.N., Ravelo, S.V.: Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. Comput. Oper. Res. 113, 104774 (2020)
5. Glover, F., Hao, J.K.: f-Flip strategies for unconstrained binary quadratic programming. Ann. Oper. Res. 238(1), 651–657 (2016)