Description:
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques in order to reduce several variants of KPC to KP which enables us to employ approaches for KP. We propose both, an equivalent reformulation and a heuristic one bringing along less computational effort. We show that the heuristic reformulation can be customized in order to provide solutions having an objective value arbitrarily close to the one of the original problem.