Heuristics for Longest Edge Selection in Simplicial Branch and Bound.
Juan F. R. HerreraLeocadio G. CasadoEligius M. T. HendrixInmaculada GarcíaPublished in: ICCSA (2) (2015)
Keyphrases
- branch and bound
- branch and bound procedure
- search algorithm
- tree search
- upper bound
- lower bound
- mini bucket
- beam search
- branch and bound algorithm
- branch and bound search
- column generation
- search space
- optimal solution
- search strategies
- tree search algorithm
- heuristic solution
- combinatorial optimization
- randomly generated problems
- network design problem
- branch and bound method
- heuristic search
- bnb adopt
- max sat
- integer programming problems
- iterative deepening
- objective function
- linear programming relaxation
- partial solutions
- lagrangian heuristic
- simulated annealing
- search heuristics
- np hard
- depth first search
- particle swarm optimization