Approximating Multiobjective Knapsack Problems
From MaRDI portal
Publication:3114821
DOI10.1287/mnsc.48.12.1603.445zbMath1232.90324OpenAlexW2060645964MaRDI QIDQ3114821
Hans Kellerer, Erlebach, Thomas, Ulrich Pferschy
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.48.12.1603.445
Related Items
Advancing local search approximations for multiobjective combinatorial optimization problems, Solving the linear multiple choice knapsack problem with two objectives: Profit and equity, Fuzzy approach to multilevel knapsack problems, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, Approximation of min-max and min-max regret versions of some combinatorial optimization problems, Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems, Robust combinatorial optimization with locally budgeted uncertainty, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem, On the rectangular knapsack problem, Balancing profits and costs on trees, Approximation Methods for Multiobjective Optimization Problems: A Survey, Preference programming for robust portfolio modeling and project selection, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, Optimal selection of touristic packages based on user preferences during sports mega-events, Approximation with a fixed number of solutions of some multiobjective maximization problems, Approximating single- and multi-objective nonlinear sum and product knapsack problems, A parameterized approximation scheme for generalized partial vertex cover, General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems, Fair allocation of indivisible items with conflict graphs, Inverse multi-objective combinatorial optimization, A tolerance function for the multiobjective set covering problem, Solving efficiently the 0-1 multi-objective knapsack problem, Approximation schemes for the parametric knapsack problem, On local optima in multiobjective combinatorial optimization problems, Covers and approximations in multiobjective optimization, Stochastic convergence of random search methods to fixed size Pareto front approximations, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems, Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem, Approximate Pareto sets of minimal size for multi-objective optimization problems, On Geometric Set Cover for Orthants, Min-max and min-max regret versions of combinatorial optimization problems: A survey, The lexicographic α-robust 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, The multiobjective multidimensional knapsack problem: a survey and a new approach
