Pages that link to "Item:Q2469794"
From MaRDI portal
The following pages link to An exact algorithm for 0-1 polynomial Knapsack problems (Q2469794):
Displaying 14 items.
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- Pseudopolynomial algorithms for the solution of backpack problems (Q1325402) (← links)
- An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229) (← links)
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function (Q1328610) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (Q3637393) (← links)
- A New Algorithm for the 0-1 Knapsack Problem (Q3789335) (← links)
- (Q4636439) (← links)
- (Q5240419) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)