A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4202023
- A new exact algorithm for concave knapsack problems with integer variables
- A new algorithm for the integer knapsack problem and its parallelization
- A new approximation algorithm for the knapsack problem
- A new approximate algorithm for the knapsack problem
- A solution method for a knapsack problem and its variant
- A new enumeration scheme for the knapsack problem
- On equivalent knapsack problems
- A New Algorithm for the Solution of the Knapsack Problem
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
Cited in
(9)- A hybrid algorithm for the unbounded knapsack problem
- Testing integer knapsacks for feasibility
- On aggregating two linear diophantine equations
- Unbounded knapsack problem: Dynamic programming revisited
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- Solving the knapsack problem via \(\mathbb Z\)-transform
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Iterative variable aggregation and disaggregation in IP: an application
- Using aggregation to optimize long-term production planning at an underground mine
This page was built for publication: A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367041)
