New branch-and-bound algorithms for k-cardinality tree problems.
Luidi SimonettiFábio ProttiYuri FrotaCid C. de SouzaPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- branch and bound algorithm
- test problems
- combinatorial optimization
- lower bound
- branch and bound
- randomly generated problems
- set covering problem
- tree structure
- optimal solution
- np hard
- upper bound
- finding an optimal solution
- neural network
- decision problems
- special case
- search space
- search algorithm
- genetic algorithm