A hybrid dynamic programming approach to the biobjective binary knapsack problem

DOI10.1145/2444016.2444018zbMath1322.90104OpenAlexW2058429724MaRDI QIDQ5178734

Olivier Spanjaard, Charles Delort

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2444016.2444018

zbMATH Keywords

multiobjective optimizationbiobjective binary knapsack problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems, A hybrid approach for biobjective optimization