Approximating multi-objective knapsack problems
From MaRDI portal
Recommendations
- Approximating multiobjective knapsack problems
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- New perspectives on multi-objective knapsack problems
- Approximation for multi-knapsack problem
Cited in
(27)- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- The packing while traveling problem
- Reference points and approximation algorithms in multicriteria discrete optimization
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for the parametric knapsack problem
- The multi-Handler knapsack problem under uncertainty
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Approximating multiobjective knapsack problems
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
- Solving multi-objective knapsack problem by a branch-and-bound procedure
- New perspectives on multi-objective knapsack problems
- scientific article; zbMATH DE number 2097195 (Why is no real title available?)
- scientific article; zbMATH DE number 7368387 (Why is no real title available?)
- Approximating multi-objective scheduling problems
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Scheduling parallel dedicated machines with the speeding-up resource
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Multi-start and path relinking methods to deal with multiobjective Knapsack problems
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
This page was built for publication: Approximating multi-objective knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778556)
