A solution method for a knapsack problem and its variant
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3852791
- scientific article; zbMATH DE number 4139486
- scientific article; zbMATH DE number 4202023
- A solution procedure for general knapsack problems with a few constraints
- An algorithm for solving a class of knapsack problems and its generalization
- A New Algorithm for the Solution of the Knapsack Problem
- scientific article; zbMATH DE number 4023019
- scientific article; zbMATH DE number 4160465
- Exact methods for the knapsack problem and its generalizations
- A branch and bound algorithm for solving the multiple-choice knapsack problem
Cites work
- A Minimal-Path Algorithm for the "Money Changing Problem"
- A note on two problems in connexion with graphs
- An Adaptive Group Theoretic Algorithm for Integer Programming Problems
- Computational experience with a group theoretic integer programming algorithm
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
- Hard Knapsack Problems
- scientific article; zbMATH DE number 3176160 (Why is no real title available?)
- scientific article; zbMATH DE number 3375561 (Why is no real title available?)
- Minimal Inequalities and Subadditive Duality
- On the existence of optimal solutions to integer and mixed-integer programming problems
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Some polyhedra related to combinatorial problems
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- The Theory and Computation of Knapsack Functions
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(27)- Knapsack feasibility as an absolute value equation solvable by successive linear programming
- On equivalent knapsack problems
- A new enumeration scheme for the knapsack problem
- Testing integer knapsacks for feasibility
- Solving the knapsack problem via \(\mathbb Z\)-transform
- On the solution of concave knapsack problems
- Gradient elements of the knapsack polytope
- Minimal equivalent binary knapsack inequalities
- Balanced integer solutions of linear equations
- scientific article; zbMATH DE number 3876925 (Why is no real title available?)
- scientific article; zbMATH DE number 4139488 (Why is no real title available?)
- scientific article; zbMATH DE number 4160465 (Why is no real title available?)
- Realization of knapsack problem solving algorithm and some of its applications
- CONSTRUCTION OF THE F-, P-AND K-TREES OF A KNAPSAK PROBLEM AND THEIR COMPUTATIONAL EXPERIMENTS
- An Algorithm for the 0-1 Equality Knapsack Problem
- STRUCTURE OF OPTIMAL SOLUTIONS OF A KNAPSACK PROBLEM SUBJECT TO A GIVEN TOTAL NUMBER OF VARIABLES USED
- A note on the solution of group knapsack problems
- Analysis of the knapsack problem using L-partition
- On Pleasant Knapsack Problems
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- A New Algorithm for the Solution of the Knapsack Problem
- Definition of the narrow intervals for variables in the integer-valued knapsack problem
- Making change and finding repfigits: balancing a knapsack
- The zone hopping problem
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- Test sets of the knapsack problem and simultaneous Diophantine approximation
- Sums of lexicographically ordered sets
This page was built for publication: A solution method for a knapsack problem and its variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028724)
