Pages that link to "Item:Q1038094"
From MaRDI portal
The following pages link to New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094):
Displaying 8 items.
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- A constructive periodicity bound for the unbounded knapsack problem (Q1758270) (← links)
- More on change-making and related problems (Q2051861) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- (Q5874497) (← links)
