Pages that link to "Item:Q5189094"
From MaRDI portal
The following pages link to An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem (Q5189094):
Displayed 4 items.
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540) (← links)