Dynamic programming algorithms for the zero-one knapsack problem
From MaRDI portal
Publication:1138485
DOI10.1007/BF02243880zbMath0431.90076OpenAlexW1563501581MaRDI QIDQ1138485
Publication date: 1980
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243880
Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Boolean programming (90C09)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Exact methods for the knapsack problem and its generalizations, A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem, Exact algorithms for the minimum cost vertex blocker clique problem, A new enumeration scheme for the knapsack problem, Hybrid approaches for the two-scenario max-min knapsack problem, A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs, A dynamic programming algorithm for the knapsack problem with setup, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, A multiperiod vehicle lease planning for urban freight consolidation network, The knapsack problem with generalized upper bounds, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, STATIC STOCHASTIC KNAPSACK PROBLEMS, LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup, Exact algorithms for the guillotine strip cutting/packing problem., On Bilevel Optimization with Inexact Follower, An incentive dynamic programming method for the optimization of scholarship assignment, Single-vendor multi-buyer inventory coordination under private information, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Solving knapsack problems on GPU, Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem, Two-stage network constrained robust unit commitment problem, Novel binary differential evolution algorithm for knapsack problems, Solving robust bin-packing problems with a branch-and-price approach, The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
Cites Work
- Unnamed Item
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Reduction Algorithm for Zero-One Single Knapsack Problems
- When the Greedy Solution Solves a Class of Knapsack Problems
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- Computing Partitions with Applications to the Knapsack Problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- Branch-and-Bound Strategies for Dynamic Programming
- A Direct Descent Binary Knapsack Algorithm
- A Branch Search Algorithm for the Knapsack Problem
