An Enumeration Algorithm for Knapsack Problems

DOI10.1287/OPRE.18.2.306zbMath0195.20801OpenAlexW2148214747MaRDI QIDQ5591244

A. Victor Cabot

Publication date: 1970

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.18.2.306

zbMATH Keywords

operations research

Related Items (16)

A computational study of an objective hyperplane search heuristic for the general integer linear programming problem ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ Coefficient reduction for inequalities in 0–1 variables ⋮ An exact algorithm for large unbounded knapsack problems ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A characterisation of all feasible solutions to an integer program ⋮ Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ 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 ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: An Enumeration Algorithm for Knapsack Problems