Unbounded knapsack problem: Dynamic programming revisited
From MaRDI portal
Recommendations
Cites work
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- A note on dominance relation in unbounded knapsack problems
- An LP-based approach to a two-stage cutting stock problem
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 936863 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On dominated terms in the general knapsack problem
- Reducing the number of variables in integer and linear programming problems
- The Multiple-Choice Knapsack Problem
- The Theory and Computation of Knapsack Functions
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(34)- A hybrid algorithm for the unbounded knapsack problem
- A note on dominance relation in unbounded knapsack problems
- Average performance of greedy heuristics for the integer knapsack problem.
- Unbounded knapsack problem: Dynamic programming revisited
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators
- Multiperiod capacity expansion of a telecommunications connection with uncertain demand
- Bridging game theory and the knapsack problem: a theoretical formulation
- Approximation schemes for multiperiod binary knapsack problems
- Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Fuzzy approach to multilevel knapsack problems
- Piece selection algorithms for layered video streaming in P2P networks
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Dynamic programming algorithms for generating optimal strip layouts
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- Generating optimal two-section cutting patterns for rectangular blanks
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- The unbounded knapsack problem
- Algebraic dynamic programming for multiple context-free grammars
- Two topics in dominance relations for the unbounded knapsack problem
- Determining the K-best solutions of knapsack problems
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- A theory of auto-scaling for resource reservation in cloud services
- On the exact separation of mixed integer knapsack cuts
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Simplest optimal cutting patterns for equal rectangles
- Using modifications to Grover's search algorithm for quantum global optimization
This page was built for publication: Unbounded knapsack problem: Dynamic programming revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569945)
