Pages that link to "Item:Q1887952"

The following pages link to Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952):

Displaying 6 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)