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

DOI10.1007/978-3-540-75520-3_63MaRDI QIDQ3527261zbMATH OpenOpenAlexFDO

Authors Hadrien Hugot, Daniel Vanderpooten, 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

approximationcombinatorial optimizationdominance relationsdynamic programmingmulti-objective knapsack problem

Mathematics Subject Classification ID

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

Recommendations

• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• scientific article; zbMATH DE number 1830735
• A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems

Cited in

(8)

• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• An FPTAS for the -modular multidimensional knapsack problem
• Approximating multiobjective knapsack problems
• scientific article; zbMATH DE number 7561569 (Why is no real title available?)
• An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
• Solving efficiently the 0-1 multi-objective knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527261)