An Efficient Algorithm for the 0-1 Knapsack Problem
From MaRDI portal
Cited in
(35)- A successive approximation algorithm for the multiple knapsack problem
- The zero-one knapsack problem with equality constraint
- Zero-one integer programs with few contraints - lower bounding theory
- Some computational results on real 0-1 knapsack problems
- Exact methods for the knapsack problem and its generalizations
- An integer programming model for the allocation of databases in a distributed computer system
- Efficient algorithms for the capacitated concentrator location problem
- Comment on 'Some computational results on real 0-1 knapsack problems'
- An improved direct descent algorithm for binary knapsack problems
- Dynamic programming algorithms for the zero-one knapsack problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- The 0-1 knapsack problem with multiple choice constraints
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- An algorithm and efficient data structures for the binary knapsack problem
- File allocation involving worst case response times and link capacities: Model and solution procedure
- Optimizing single-terminal dispatch of large volume trips to trucks
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- An exact approach for the 0-1 knapsack problem with setups
- Formulating and solving production planning problems
- Lagrangian relaxation and pegging test for the clique partitioning problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
- An improved enumeration for pure 0-1 programs
- An algorithm for the 0/1 Knapsack problem
- The Collapsing 0–1 Knapsack Problem
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- Local-search based heuristics for advertisement scheduling
- Solving capacitated clustering problems
- Coordinated production scheduling for make-to-order manufacturing
- Single-vendor multi-buyer inventory coordination under private information
This page was built for publication: An Efficient Algorithm for the 0-1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105496)
