Heuristics for branch-and-bound global allocation.
Julio SeptiénDaniel MozosFrancisco TiradoRomán HermidaMilagros FernándezPublished in: EURO-DAC (1992)
Keyphrases
- branch and bound
- branch and bound procedure
- search algorithm
- beam search
- tree search
- branch and bound algorithm
- lower bound
- mini bucket
- column generation
- search space
- branch and bound search
- upper bound
- combinatorial optimization
- optimal solution
- heuristic solution
- search strategies
- tree search algorithm
- heuristic search
- partial solutions
- bnb adopt
- network design problem
- branch and bound method
- randomly generated problems
- depth first search
- objective function
- linear programming relaxation
- simulated annealing
- np hard
- search methods
- np complete
- integer programming problems