Pages that link to "Item:Q3028724"
From MaRDI portal
The following pages link to A solution method for a knapsack problem and its variant (Q3028724):
Displaying 19 items.
- The zone hopping problem (Q750298) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- Test sets of the knapsack problem and simultaneous Diophantine approximation (Q826096) (← links)
- Sums of lexicographically ordered sets (Q912760) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- On equivalent knapsack problems (Q1082265) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Testing integer knapsacks for feasibility (Q1266633) (← links)
- Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019) (← links)
- Gradient elements of the knapsack polytope (Q2569821) (← links)
- Minimal equivalent binary knapsack inequalities (Q2899135) (← links)
- (Q3487133) (← links)
- Realization of knapsack problem solving algorithm and some of its applications (Q3655032) (← links)
- CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS (Q3724093) (← links)
- An Algorithm for the 0-1 Equality Knapsack Problem (Q3815132) (← links)
- STRUCTURE OF OPTIMAL SOLUTIONS OF A KNAPSACK PROBLEM SUBJECT TO A GIVEN TOTAL NUMBER OF VARIABLES USED (Q3820376) (← links)
- A note on the solution of group knapsack problems (Q3979526) (← links)
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination (Q4367041) (← links)
- A New Algorithm for the Solution of the Knapsack Problem (Q4739793) (← links)
