Pages that link to "Item:Q947962"

The following pages link to Solving efficiently the 0-1 multi-objective knapsack problem (Q947962):

Displaying 45 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Cross entropy for multiobjective combinatorial optimization problems with linear relaxations (Q319096) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
• Multi-directional local search (Q339654) (← links)
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
• Interactive procedure for a multiobjective stochastic discrete dynamic problem (Q377737) (← links)
• On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
• Dynamic programming with ordered structures: Theory, examples and applications (Q622035) (← links)
• Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
• What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← links)
• On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
• Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem (Q1644042) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
• Lorenz dominance based algorithms to solve a practical multiobjective problem (Q1725590) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
• Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
• The binary knapsack problem with qualitative levels (Q2029032) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables (Q2165268) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• AN OPTIMIZATION MODEL FOR REUSE SCENARIO SELECTION CONSIDERING RELIABILITY AND COST IN SOFTWARE PRODUCT LINE DEVELOPMENT (Q2892539) (← links)
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
• Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Computing efficiently the nondominated subset of a set sum (Q6080591) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← links)