Pages that link to "Item:Q702759"

The following pages link to A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation (Q702759):

Displaying 14 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• (Q3500140) (← links)