A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3-SAT Problems-Reference-Cited by-同舟云学术

A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3-SAT Problems

Published:1995 Issue: Volume: Page:547-554
ISSN:
Container-title:Intelligent Systems Third Golden West International Conference
language:
Short-container-title:

Author:

Frank Jeremy

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-7108-3_57

Reference13 articles.

1. P. Cheeseman, Bob Kanefsky, William Taylor. “Where the Really Hard Problems Are.” Proceedings of the 12th IJCAI, 1991.

2. F. Glover. “Tabu Search for Nonlinear and Parametric Optimizations“, Discrete Applied Mathematics, 1991.

3. D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Menlo Park, Wiley and Sons, 1989.

4. D. Goldberg. “Sizing Populations for Serial and Parallel Genetic Algorithms.” Proceedings, 3d International Conference on Genetic Algorithms, 1989.

5. J. Holland. Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ABSO: Advanced Bee Swarm Optimization Metaheuristic and Application to Weighted MAX-SAT Problem;Brain Informatics;2011

2. Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework;Genetic Programming and Evolvable Machines;2009-10-20

3. Scatter Search and Genetic Algorithms for MAX-SAT Problems;Journal of Mathematical Modelling and Algorithms;2008-02-27

4. Efficient and Experimental Meta-heuristics for MAX-SAT Problems;Experimental and Efficient Algorithms;2005

5. Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems;Engineering of Intelligent Systems;2001