Login / Signup
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets.
Sune Lauth Gadegaard
Lars Relund Nielsen
Matthias Ehrgott
Published in:
INFORMS J. Comput. (2019)
Keyphrases
</>
bi objective
worst case
multi objective
linear programming
lp relaxation
computationally efficient
computational efficiency
genetic algorithm
upper bound
lower bound
neural network
computational complexity
energy minimization
knapsack problem
multi objective optimization
space complexity
objective function