Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Beasley JE (1999) Heuristic algorithm for the unconstrained binary quadratic programming problem, Working Paper, Imperial College.
2. Bjorndal MH, Caprara A, Cowling PI, Della Crosce F, Lourenço H, Malucelli F, Orman AJ, Pisinger D, Rego C, Salazar JJ (1995) Some thoughts on combinatorial optimization. European Journal of Operational Research 83: 153–170.
3. Glover F (1997) A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald E, Schoenauer D, Snyers D (eds) Artificial Evolution, Lecture Notes in Computer Science, 1363. Heidelberg, pp 13–54.
4. Glover F, Kochenberger GA, Alidaee B (1998) Adaptive memory tabu search for binary quadratic programs, Management Science. 44.(3): 336–345.
5. Glover F, Alidaee B, Rego C, Kochenberger GA (2002) One-pass heuristics for large-scale unconstrained binary quadratic problems, European Journal of Operational Research 137: 272–287.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献