Dynamic programming algorithms for the zero-one knapsack problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3637598 (Why is no real title available?)
- A Branch Search Algorithm for the Knapsack Problem
- A Direct Descent Binary Knapsack Algorithm
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Branch-and-Bound Strategies for Dynamic Programming
- Computing Partitions with Applications to the Knapsack Problem
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- Reduction Algorithm for Zero-One Single Knapsack Problems
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(34)- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- Single-vendor multi-buyer inventory coordination under private information
- The knapsack problem with generalized upper bounds
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Exact algorithms for the minimum cost vertex blocker clique problem
- An incentive dynamic programming method for the optimization of scholarship assignment
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Hybrid approaches for the two-scenario max-min knapsack problem
- On bilevel optimization with inexact follower
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
- Solving robust bin-packing problems with a branch-and-price approach
- Static stochastic Knapsack problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- A multiperiod vehicle lease planning for urban freight consolidation network
- Novel binary differential evolution algorithm for knapsack problems
- A dynamic programming algorithm for the knapsack problem with setup
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Exact methods for the knapsack problem and its generalizations
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- Local-search based heuristics for advertisement scheduling
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Solving knapsack problems on GPU
- A new enumeration scheme for the knapsack problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Two-stage network constrained robust unit commitment problem
- An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
This page was built for publication: Dynamic programming algorithms for the zero-one knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138485)
