A better step-off algorithm for the knapsack problem

DOI10.1016/0166-218X(80)90051-7MaRDI QIDQ1137512zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137512)