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

DOI10.1023/A:1011921025322zbMath0987.68615OpenAlexW1573105844MaRDI QIDQ5960735

Alan P. French, John M. Wilson, Andrew C. Robinson

Publication date: 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011921025322

zbMATH Keywords

branch and bound genetic algorithm maximum satisfiability

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Evolutionary hybrid approaches for generation scheduling in power systems ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Hybridizing exact methods and metaheuristics: a taxonomy

This page was built for publication: Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems