On equivalent knapsack problems
From MaRDI portal
Recommendations
Cited in
(17)- A relation between the knapsack and group knapsack problems
- Minimal equivalent binary knapsack inequalities
- On aggregating two linear diophantine equations
- Solving the knapsack problem via \(\mathbb Z\)-transform
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- When two-constraint binary knapsack problem is equivalent to classical knapsack problem?
- Integer knapsack problems with profit functions of the same value range
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- scientific article; zbMATH DE number 4143769 (Why is no real title available?)
- Hard Equality Constrained Integer Knapsacks
- CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS
- New results for aggregating integer-valued equations
- On Pleasant Knapsack Problems
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- scientific article; zbMATH DE number 2119958 (Why is no real title available?)
- scientific article; zbMATH DE number 4139488 (Why is no real title available?)
- An exact algorithm for large unbounded knapsack problems
This page was built for publication: On equivalent knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082265)
