Technical Note—The Multiperiod Knapsack Problem

DOI10.1287/opre.29.3.612zbMath0455.90059OpenAlexW2151728485MaRDI QIDQ3904376

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 algorithmcomputational experiencelarge-scale problemscalculation of boundsmultiperiod knapsack problem

Mathematics Subject Classification ID

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

Related Items (9)

Exact methods for the knapsack problem and its generalizations ⋮ The knapsack problem with generalized upper bounds ⋮ Bounds for nested knapsack problems ⋮ On approximating the incremental knapsack problem ⋮ A multi-period renewal equipment problem ⋮ On the approximability of the two-phase knapsack problem ⋮ The Fixed-Charge Shortest-Path Problem ⋮ Approximating the optimal sequence of acquisitions and sales with a capped budget ⋮ Approximation schemes for multiperiod binary knapsack problems

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