Login / Signup
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems.
Kerstin Dächert
Kathrin Klamroth
Published in:
J. Glob. Optim. (2015)
Keyphrases
</>
small number
optimization problems
computational complexity
cost function
upper bound
objective function
finite number
data sets
artificial intelligence
case study
data structure
evolutionary algorithm
combinatorial optimization
memory requirements