Two novel branch and bound algorithms for the vertex bisection problem.
Carlos SotoEduardo Del Ángel-MartínezHéctor Joaquín Fraire HuacujaBernabé DorronsoroNelson Rangel-ValdezLaura Cruz ReyesPublished in: Expert Syst. Appl. (2022)
Keyphrases
- branch and bound algorithm
- vertex set
- lower bound
- branch and bound
- randomly generated
- np hard
- optimal solution
- upper bound
- combinatorial optimization
- haplotype inference
- search tree
- combinatorial problems
- finding an optimal solution
- variable ordering
- set covering problem
- undirected graph
- directed graph
- boolean satisfiability
- search algorithm
- column generation
- search space
- constraint satisfaction problems
- np complete