Pages that link to "Item:Q360382"

The following pages link to Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382):

Displaying 11 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
• Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← links)