A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs.
Valentina CacchianiClaudia D'AmbrosioPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- branch and bound
- multi objective
- lower bound
- branch and bound algorithm
- multi objective optimization
- optimal solution
- search algorithm
- optimization algorithm
- evolutionary algorithm
- upper bound
- search space
- column generation
- combinatorial optimization
- objective function
- convex optimization
- genetic algorithm
- branch and bound procedure
- multiple objectives
- particle swarm optimization
- lagrangian heuristic
- randomly generated problems
- mixed integer
- beam search
- branch and bound method
- search strategies
- depth first search
- network design problem
- partial solutions
- convex hull
- tree search algorithm
- integer programming problems
- multi agent
- tree search
- branch and bound search
- multistage
- simulated annealing
- optimization problems
- convex programming
- max sat
- constraint propagation
- search tree
- np hard