Memetic algorithms for the unconstrained binary quadratic programming problem.

[1]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[2]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[3]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4]  H. P. Schwefel,et al.  Numerische Optimierung von Computermodellen mittels der Evo-lutionsstrategie , 1977 .

[5]  Jakob Krarup,et al.  Computer-aided layout design , 1978 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  R. McBride,et al.  An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .

[8]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[9]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[10]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

[11]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[12]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[13]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[14]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[15]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[16]  Panos M. Pardalos,et al.  A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..

[17]  G. Kochenberger,et al.  0-1 Quadratic programming approach for optimum solutions of two scheduling problems , 1994 .

[18]  J. Ben Rosen,et al.  A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..

[19]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[20]  Alain Billionnet,et al.  Minimization of a quadratic pseudo-Boolean function , 1994 .

[21]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[22]  H. Waelbroeck,et al.  Complex Systems and Binary Networks , 1995 .

[23]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[24]  Larry J. Eshelman,et al.  Proceedings of the 6th International Conference on Genetic Algorithms , 1995 .

[25]  Peter F. Stadler,et al.  Local minima in the graph bipartitioning problem , 1996 .

[26]  P. Stadler.  Landscapes and their correlation functions , 1996 .

[27]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[28]  John E. Beasley,et al.  Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .

[29]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[30]  Talal M. Alkhamis,et al.  Simulated annealing for the unconstrained quadratic pseudo-Boolean function , 1998, Eur. J. Oper. Res..

[31]  C. Helmberg,et al.  Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .

[32]  James Kennedy,et al.  Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review] , 1999, IEEE Transactions on Evolutionary Computation.

[33]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[34]  B. Freisleben,et al.  Genetic algorithms for binary quadratic programming , 1999 .

[35]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[36]  Andrea Lodi,et al.  An evolutionary heuristic for quadratic 0-1 programming , 1999, Eur. J. Oper. Res..

[37]  Bahram Alidaee,et al.  A scatter search approach to unconstrained quadratic binary programs , 1999 .

[38]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[39]  F. Glover,et al.  Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs , 1999 .

[40]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[41]  Kengo Katayama,et al.  Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm , 2000, GECCO.

[42]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[43]  K. Katayama,et al.  A Variant k-opt Local Search Heuristic for Binary Quadratic Programming , 2001 .

[44]  Kengo Katayama,et al.  Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem , 2001, Eur. J. Oper. Res..

[45]  Bernd Freisleben,et al.  Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.

[46]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[47]  Panos M. Pardalos,et al.  Computational aspects of a branch and bound algorithm for quadratic zero-one programming , 1990, Computing.