Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
type: Item
instance of: scholarly article
title: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
zbMATH Open document ID: 1163.90726
author: Cristina Bazgan
author: Hadrien Hugot
author: Daniel Vanderpooten
published in: European Journal of Operational Research
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5571491
zbMATH Keywords: multi-objective knapsack problem
zbMATH Keywords: approximation
zbMATH Keywords: dynamic programming
zbMATH Keywords: dominance relations
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.07.047
OpenAlex ID: W2000124998
cites work: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
cites work: Solving efficiently the 0-1 multi-objective knapsack problem
cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
cites work: Multicriteria Optimization
cites work: Approximating Multiobjective Knapsack Problems
cites work: Q4821303
cites work: Q4945108
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Discrete Dynamic Programming and Capital Allocation
cites work: Q3802899
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
DOI: 10.1016/J.EJOR.2008.07.047
description: scientific article; zbMATH DE number 5571491