Pareto optimization in algebraic dynamic programming
Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of d...
| Main Authors: | , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
BioMed Central
2015
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4491898/ |