An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem

DOI10.1007/978-3-540-72845-0_31zbMath1203.90128OpenAlexW2112125343MaRDI QIDQ5432328

Hadrien Hugot, Daniel Vanderpooten, Cristina Bazgan

Publication date: 2 January 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/5916

zbMATH Keywords

dynamic programmingcombinatorial optimizationefficient solutionsdominance relationsmulti-objective knapsack problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)

This page was built for publication: An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem