Pages that link to "Item:Q1095029"
From MaRDI portal
The following pages link to A new enumeration scheme for the knapsack problem (Q1095029):
Displaying 11 items.
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- On dominated terms in the general knapsack problem (Q1371953) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination (Q4367041) (← links)
- Checkerboard pattern: proposals for its generation (Q4669796) (← links)
- A New Algorithm for the Solution of the Knapsack Problem (Q4739793) (← links)
- Extension of Brickell’S Algorithm for Breaking High Density Knapsacks (Q5000237) (← links)
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem (Q5189094) (← links)