Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Easy problems are sometimes hard
Artificial Intelligence
Resolution and the integrality of satisfiability problems
Mathematical Programming: Series A and B
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
A proposal for a hybrid meta-strategy for combinatorial optimization problems
Journal of Heuristics
Genetic branch-and-bound or exact genetic algorithm?
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems.
Proceedings of the 13th annual conference on Genetic and evolutionary computation
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Solving extremely difficult MINLP problems using adaptive resolution Micro-GA with tabu search
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
| Hi-index | 0.00 |
The satisfiability problem in forms such as maximum satisfiability (MAX-SAT) remains a hard problem. The most successful approaches for solving such problems use a form of systematic tree search. This paper describes the use of a hybrid algorithm, combining genetic algorithms and integer programming branch and bound approaches, to solve MAX-SAT problems. Such problems are formulated as integer programs and solved by a hybrid algorithm implemented within standard mathematical programming software. Computational testing of the algorithm, which mixes heuristic and exact approaches, is described.