Approximating multiobjective knapsack problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1830735
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- The multiobjective multidimensional knapsack problem: a survey and a new approach
Cited in
(54)- The multi-Handler knapsack problem under uncertainty
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- scientific article; zbMATH DE number 7368387 (Why is no real title available?)
- A parameterized approximation scheme for generalized partial vertex cover
- A tolerance function for the multiobjective set covering problem
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem
- Inverse multi-objective combinatorial optimization
- New perspectives on multi-objective knapsack problems
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- scientific article; zbMATH DE number 2097195 (Why is no real title available?)
- scientific article; zbMATH DE number 1784663 (Why is no real title available?)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- On the rectangular knapsack problem
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Robust combinatorial optimization with locally budgeted uncertainty
- Optimal selection of touristic packages based on user preferences during sports mega-events
- 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
- scientific article; zbMATH DE number 1149800 (Why is no real title available?)
- Preference programming for robust portfolio modeling and project selection
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Stochastic convergence of random search methods to fixed size Pareto front approximations
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- The lexicographic \(\alpha \)-robust knapsack problem
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Balancing profits and costs on trees
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- On Geometric Set Cover for Orthants
- Advancing local search approximations for multiobjective combinatorial optimization problems
- Fuzzy approach to multilevel knapsack problems
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
- scientific article; zbMATH DE number 1830735 (Why is no real title available?)
- Approximating multi-objective scheduling problems
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Approximation schemes for the parametric knapsack problem
- Fair allocation of indivisible items with conflict graphs
- Covers and approximations in multiobjective optimization
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Multi-start and path relinking methods to deal with multiobjective Knapsack problems
- On local optima in multiobjective combinatorial optimization problems
This page was built for publication: Approximating multiobjective knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114821)
