lsmear: a variable selection strategy for interval branch and bound solvers.
Ignacio ArayaBertrand NeveuPublished in: J. Glob. Optim. (2018)
Keyphrases
- branch and bound
- selection strategy
- branch and bound algorithm
- search algorithm
- lower bound
- selection strategies
- search space
- upper bound
- combinatorial optimization
- optimal solution
- column generation
- search strategies
- sat solvers
- tree search algorithm
- selection algorithm
- randomly generated problems
- branch and bound procedure
- tree search
- network design problem
- genetic algorithm
- beam search
- multi objective
- branch and bound method
- heuristic search
- fitness function
- search heuristics
- lagrangian heuristic