Pages that link to "Item:Q1569945"

The following pages link to Unbounded knapsack problem: Dynamic programming revisited (Q1569945):

Displaying 31 items.

• Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
• Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
• Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
• Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
• On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
• An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
• Simplest optimal cutting patterns for equal rectangles (Q867922) (← links)
• Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
• A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
• Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
• Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
• An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
• Multiperiod capacity expansion of a telecommunications connection with uncertain demand (Q1883893) (← links)
• Bridging game theory and the knapsack problem: a theoretical formulation (Q1990251) (← links)
• Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
• Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process (Q2158010) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
• Piece selection algorithms for layered video streaming in P2P networks (Q2440125) (← links)
• Dynamic programming algorithms for the optimal cutting of equal rectangles (Q2504483) (← links)
• Dynamic programming algorithms for generating optimal strip layouts (Q2506184) (← links)
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
• Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
• Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
• The Unbounded Knapsack Problem (Q2971610) (← links)
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
• A Theory of Auto-Scaling for Resource Reservation in Cloud Services (Q5046013) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)