An upper bound for the zero-one knapsack problem and a branch and bound algorithm

European Journal of Operational Research

Volumn 1, Issue 3, 1977, Pages 169-175

  Martello, Silvano ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

MATHEMATICAL PROGRAMMING;

EID: 0017492938     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(77)90024-8     Document Type: Article

References (12)

1. An enumeration algorithm for knapsack problems
2. Discrete variable extremum problems
3. Solution of the value-independent knapsack problem by partitioning
4. The theory and computation of knapsack functions
5. A branch search algorithm for the knapsack problem
6. A polynomial-time algorithm for the knapsack problem with two variables
7. Computing partitions with applications to the knapsack problem
8. A reduction algorithm for zero-one single knapsack problems
9. A branch and bound algorithm for the knapsack problem
10. Approximate algorithms for the 0/1 knapsack problem
11. A finite renewal algorithm for the knapsack and turnpike models