Pages that link to "Item:Q3114821"
From MaRDI portal
The following pages link to Approximating Multiobjective Knapsack Problems (Q3114821):
Displayed 37 items.
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Stochastic convergence of random search methods to fixed size Pareto front approximations (Q545118) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- Preference programming for robust portfolio modeling and project selection (Q877643) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- On the rectangular knapsack problem (Q2168057) (← links)
- Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Inverse multi-objective combinatorial optimization (Q2444572) (← links)
- On local optima in multiobjective combinatorial optimization problems (Q2468765) (← links)
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- The lexicographic α-robust knapsack problem (Q3087844) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Balancing profits and costs on trees (Q5326788) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- A parameterized approximation scheme for generalized partial vertex cover (Q6138992) (← links)