Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems

Journal of Heuristics

Volumn 7, Issue 6, 2001, Pages 551-564

  French, Alan P ^a   Robinson, Andrew C ^a   Wilson, John M ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Branch and bound; Genetic algorithm; Maximum satisfiability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

BRANCH AND BOUND APPROACH; MAXIMUM SATISFIABILITY; STANDARD MATHEMATICAL PROGRAMMING SOFTWARE; SYSTEMATIC TREE SEARCH;

GENETIC ALGORITHMS;

EID: 0035504901     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011921025322     Document Type: Article

References (20)

1. A genetic algorithm for the set covering problem
2. Some results and experiments in programming techniques for propositional logic
3. The complexity of theorem-proving procedures
4. Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP
5. A computing procedure for quantification theory
6. Using genetic algorithms to solve NP-complete problems
7. Easy problems are sometimes hard
8. A computational study of satisfiability algorithms for propositional logic
9. Resolution and the integrality of satisfiability problems
10. Branching rules for satisfiability
11. Solving propositional satisfiability problems
12. An automatic method for solving discrete programming problems
13. A combined branch and bound and genetic algorithm based for a flowshop scheduling algorithm
14. Hybrid genetic algorithms for bin-packing and related problems