An Enumeration Algorithm for Knapsack Problems
From MaRDI portal
Cited in
(16)- Zero-one integer programs with few contraints - lower bounding theory
- A characterisation of all feasible solutions to an integer program
- Fourier-Motzkin elimination extension to integer programming problems
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- An algorithm and efficient data structures for the binary knapsack problem
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
- The multidimensional 0-1 knapsack problem: an overview.
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Coefficient reduction for inequalities in 0–1 variables
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- An exact algorithm for large unbounded knapsack problems
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
This page was built for publication: An Enumeration Algorithm for Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5591244)
