A better step-off algorithm for the knapsack problem

DOI10.1016/0166-218X(80)90051-7zbMath0428.90044OpenAlexW2005421729MaRDI QIDQ1137512

Harold Greenberg, Israel Feldman

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90051-7

zbMATH Keywords

knapsack problemstep-off algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (3)

The knapsack problem with generalized upper bounds ⋮ An exact algorithm for large unbounded knapsack problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem

Cites Work

• An algorithm for a linear Diophantine equation and a problem of Frobenius
• A Finite Renewal Algorithm for the Knapsack and Turnpike Models
• The Theory and Computation of Knapsack Functions

This page was built for publication: A better step-off algorithm for the knapsack problem