Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Solving efficiently the 0-1 multi-objective knapsack problem
Computers and Operations Research
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Environmental Modelling & Software
Solving the linear multiple choice knapsack problem with two objectives: profit and equity
Computational Optimization and Applications
Near Admissible Algorithms for Multiobjective Search
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Fuzzy approach to multilevel knapsack problems
Computers & Mathematics with Applications
A practical efficient fptas for the 0-1 multi-objective knapsack problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Environmental Modelling & Software
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximation with a fixed number of solutions of some biobjective maximization problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On beam search for multicriteria combinatorial optimization problems
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Anytime algorithms for biobjective heuristic search
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Approximating multi-objective scheduling problems
Computers and Operations Research
Single approximation for the biobjective Max TSP
Theoretical Computer Science
Multiple objective scheduling of HPC workloads through dynamic prioritization
Proceedings of the High Performance Computing Symposium
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
Computational Optimization and Applications
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
Note: Inverse multi-objective combinatorial optimization
Discrete Applied Mathematics
| Hi-index | 0.01 |
For multiobjective optimization problems, it is meaningful to compute a set of solutions covering all possible trade-offs between the different objectives. The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, efficient algorithms for computing a provably good approximation to the set of all nondominated feasible solutions, the Pareto frontier, are studied.For the multiobjective one-dimensional knapsack problem, a practical fully polynomial-time approximation scheme (FPTAS) is derived. It is based on a new approach to the single-objective knapsack problem using a partition of the profit space into intervals of exponentially increasing length. For the multiobjectivem-dimensional knapsack problem, the first known polynomial-time approximation scheme (PTAS), based on linear programming, is presented.