Technical Note—The Multiperiod Knapsack Problem

DOI10.1287/OPRE.29.3.612MaRDI QIDQ3904376zbMATH OpenOpenAlexFDO

Authors Bruce Faaland

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

branch and bound algorithmcalculation of boundscomputational experiencelarge-scale problemsmultiperiod knapsack problem

Mathematics Subject Classification ID

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

Cited in

(9)

• Exact methods for the knapsack problem and its generalizations
• The knapsack problem with generalized upper bounds
• Bounds for nested knapsack problems
• Approximation schemes for multiperiod binary knapsack problems
• On the approximability of the two-phase knapsack problem
• Approximating the optimal sequence of acquisitions and sales with a capped budget
• On approximating the incremental knapsack problem
• The fixed-charge shortest-path problem
• A multi-period renewal equipment problem

This page was built for publication: Technical Note—The Multiperiod Knapsack Problem

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