An evolutionary algorithm for the unconstrained Binary Quadratic Problems

Advances in Soft Computing

Volumn 33, Issue , 2006, Pages 3-16

  Borgulya, István ^a  

^a UNIVERSITY OF PÉCS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845422100     PISSN: 16153871     EISSN: 18600794     Source Type: Book Series    
DOI: 10.1007/3-540-31182-3_1     Document Type: Article

References (17)

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.
6. Helmberg C, Rendl F (1998) Solving quadratic (0,1)-problem by semidefinite programs and cutting planes, Mathematical Programming 82: 388-399.
7. Horst R, Pardalos PM, Thoai NV (2000) Introduction to Global Optimization 2nd Edition, Kluwer Ac. Pub. Dordrecht
8. Katayama K, Narihisa H (2001) Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, European Journal of Operational Research 134: 103-119.
9. Katayama K, Narihisa H (2001a) On Fundamental Design of Parthenogenetic Algorithm for the Binary Quadratic Programming Problem, Proceeding of the 2001 Congress on Evolutionary Computing. Seoul. Vol. 1: 356-363.
10. Lodi A, Allemand K, Liebling M (1999) An evolutionary heuristic for quadratic 0-1 programming, European Journal of Operational Research 119: 662-670.
11. Merz P, Freisleben B (1999) Genetic algorithm for binary quadratic programming, in: Proceeding of the 1999 international Genetic and Evolutionary Computation Conference, Morgan Kaufmann, Los Altos, CA, pp 417-424.
12. Merz P, Freisleben B (2002) Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. Journal of Heuristics, vol. 8, no.2, pp 197-213.
13. Merz P, Katayama K (2001) A Hybrid Evolutionary Local Search Approach for the Unconstrained Binary Quadratic Programming Problem. Tech. Rep., Department of Computer Science, University of Tübingen, Germany. Accepted for publication in Bio Systems.
14. Pardalos PM, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 45: 131-144.
15. Sebag M, Schoenauer M, Ravisé C (1997) Toward Civilized Evolution: Developing Inhibitions. In: Bäck T (ed): Proc. of the 7th International Conference on Genetic Algorithm. Morgan Kaufmann Pub. San Francisco, pp 291-298.
16. Sherali HD, Adams WP (1998) A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Kluwer Academic Publishers, Dordrecht
17. Shor NZ (1998) Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers, Dordrecht