Login / Signup
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods.
José Fernández
Boglárka Tóth
Published in:
Comput. Optim. Appl. (2009)
Keyphrases
</>
branch and bound
bi objective
optimization problems
lower bound
efficient solutions
evolutionary algorithm
column generation
search algorithm
combinatorial optimization
neural network
upper bound
set covering problem
bayesian networks
optimal solution
search strategies