Pages that link to "Item:Q360382"
From MaRDI portal
The following pages link to Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382):
Displayed 7 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)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)