Pages that link to "Item:Q558641"
From MaRDI portal
The following pages link to An algorithm for solving a class of knapsack problems and its generalization (Q558641):
Displaying 20 items.
- Yet harder knapsack problems (Q653327) (← links)
- Solving sequential knapsack problems (Q688211) (← links)
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- An algorithm for the continuous variable upper bound knapsack problem (Q1108930) (← links)
- An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Pseudopolynomial algorithms for the solution of backpack problems (Q1325402) (← links)
- A special class parametric of knapsack problems: Analytic aids and heuristics (Q1390270) (← links)
- A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem (Q1605065) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Algorithms with guarantee value for knapsack problems (Q2903135) (← links)
- Improved Generic Algorithms for Hard Knapsacks (Q3003392) (← links)
- A solution method for a knapsack problem and its variant (Q3028724) (← links)
- (Q3141337) (← links)
- Realization of knapsack problem solving algorithm and some of its applications (Q3655032) (← links)
- (Q3751378) (← links)
- (Q3993418) (← links)
- (Q4233347) (← links)
- A New Algorithm for the Solution of the Knapsack Problem (Q4739793) (← links)
- Algorithmic Applications in Management (Q5710147) (← links)