Pages that link to "Item:Q857299"

The following pages link to Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299):

Displaying 11 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
• Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)