Login / Signup
On the design and anytime performance of indicator-based branch and bound for multi-objective combinatorial optimization.
Alexandre D. Jesus
Luís Paquete
Bilel Derbel
Arnaud Liefooghe
Published in:
GECCO (2021)
Keyphrases
</>
combinatorial optimization
branch and bound
multi objective
branch and bound algorithm
traveling salesman problem
simulated annealing
combinatorial optimization problems
column generation
metaheuristic
mathematical programming
search algorithm
combinatorial problems
lower bound
search space
optimization problems
branch and bound search
optimal solution
beam search
optimization algorithm
tree search
branch and bound method
tree search algorithm
search strategies
branch and bound procedure
graph theory
evolutionary algorithm
network design problem
randomly generated problems
multi objective optimization
vehicle routing problem
particle swarm optimization
combinatorial search
genetic algorithm
hard combinatorial optimization problems
linear programming relaxation
max sat
tabu search
upper bound
objective function