Výsledky vyhledávání - "biobjective binary knapsack problem ACM Reference Format"

AA Hybrid Dynamic Programming Approach to the Biobjective Binary Knapsack Problem

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www-desir.lip6.fr/%7Espanjaard/articles/jea2013.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Computations on discrete structures, G.2.1 [Combinatorics, Combinatorial algorithms, I.2.8 [Information Systems Applications, Dynamic programming General Terms, Algorithms, Performance Additional Key Words and Phrases, multiobjective optimization, biobjective binary knapsack problem ACM Reference Format

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.9571

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.9571
http://www-desir.lip6.fr/%7Espanjaard/articles/jea2013.pdf