Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
From MaRDI portal
Recommendations
- A Practical 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
- Approximation for knapsack problems with multiple constraints
Cites work
- Approximating multiobjective knapsack problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Discrete dynamic programming and capital allocation
- Heuristic algorithms for the multiple knapsack problem
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Multicriteria Optimization
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving efficiently the 0-1 multi-objective knapsack problem
Cited in
(30)- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- An FPTAS for the -modular multidimensional knapsack problem
- An FPTAS for the knapsack problem with parametric weights
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Approximating multiobjective knapsack problems
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- scientific article; zbMATH DE number 1830735 (Why is no real title available?)
- A new effective dynamic program for an investment optimization problem
- Approximation schemes for the parametric knapsack problem
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- Covers and approximations in multiobjective optimization
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- A parameterized approximation scheme for generalized partial vertex cover
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Single machine scheduling with assignable due dates to minimize maximum and total late work
- Multicriteria decision making
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- The two single-machine scheduling problems with slack due date to minimize total early work and late work
- Solving efficiently the 0-1 multi-objective knapsack problem
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
This page was built for publication: Implementing an 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 Q1027579)
