A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem

DOI10.1007/978-3-540-75520-3_63zbMath1151.90520OpenAlexW2153074002MaRDI QIDQ3527261

Daniel Vanderpooten, Hadrien Hugot, Cristina Bazgan

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingcombinatorial optimizationapproximationdominance relationsmulti-objective knapsack problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Uses Software

• Knapsack