Genetic algorithms for binary quadratic programming
暂无分享,去创建一个
[1] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[2] A. Dickson. On Evolution , 1884, Science.
[3] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[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] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[11] Pablo Moscato,et al. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .
[12] Michael Jünger,et al. Experiments in quadratic 0–1 programming , 1989, Math. Program..
[13] Larry J. Eshelman,et al. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.
[14] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[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] P. Stadler. Fitness Landscapes , 1993 .
[18] G. Kochenberger,et al. 0-1 Quadratic programming approach for optimum solutions of two scheduling problems , 1994 .
[19] J. Ben Rosen,et al. A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..
[20] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[21] Alain Billionnet,et al. Minimization of a quadratic pseudo-Boolean function , 1994 .
[22] Bernd Freisleben,et al. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[23] Takeshi Yamada,et al. Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.
[24] Michael J. Todd,et al. Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[25] Bernd Freisleben,et al. A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.
[26] B. Freisleben,et al. Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[27] Bernd Freisleben,et al. On the effectiveness of evolutionary search in high-dimensional NK-landscapes , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[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] Bernd Freisleben,et al. Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem , 1998, PPSN.
[31] C. Helmberg,et al. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .
[32] Bernd Freisleben,et al. Fitness landscapes and memetic algorithm design , 1999 .
[33] B. Freisleben,et al. A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[34] Andrea Lodi,et al. An evolutionary heuristic for quadratic 0-1 programming , 1999, Eur. J. Oper. Res..
[35] Bernd Freisleben,et al. Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.