A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
DOI10.1007/978-3-540-75520-3_63zbMATH Open1151.90520OpenAlexW2153074002MaRDI QIDQ3527261FDOQ3527261
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
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
combinatorial optimizationdynamic programmingapproximationdominance relationsmulti-objective knapsack problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cited In (8)
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Title not available (Why is that?)
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
- Approximating multiobjective knapsack problems
Uses Software
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)
