Branch-and-bound and objective branching with three or more objectives.
Nicolas ForgetSune Lauth GadegaardKathrin KlamrothLars Relund NielsenAnthony PrzybylskiPublished in: Comput. Oper. Res. (2022)
Keyphrases
- branch and bound
- branch and bound algorithm
- multiple objectives
- lower bound
- search algorithm
- optimal solution
- search space
- column generation
- upper bound
- combinatorial optimization
- branch and bound method
- randomly generated problems
- branch and bound procedure
- tree search
- branch and bound search
- network design problem
- depth first search
- beam search
- search strategies
- bayesian networks
- tree search algorithm
- max sat
- knapsack problem
- search strategy
- graphical models
- state space
- objective function