The following pages link to On equivalent knapsack problems (Q1082265):
Displaying 13 items.
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- On aggregating two linear diophantine equations (Q1383381) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019) (← links)
- New results for aggregating integer-valued equations (Q1904718) (← links)
- When two-constraint binary knapsack problem is equivalent to classical knapsack problem? (Q2080121) (← links)
- Minimal equivalent binary knapsack inequalities (Q2899135) (← links)
- CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS (Q3724093) (← links)
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination (Q4367041) (← links)
- Hard Equality Constrained Integer Knapsacks (Q5704196) (← links)
- Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)
