Specifically we investigate the polyhedral structure of the knapsack problem with a single continuous variable, called the mixed 0-1 knapsack problem. First different classes of facet-defining inequalities are derived based on restriction and lifting. The order of lifting, particularly of the continuous variable, plays an important role. Secondly we show that the flow cover inequalities derived for the single node flow set, consisting of arc flows into and out of a single node with binary variable lower and upper bounds on each arc, can be obtained from valid inequalities for the mixed 0-1 knapsack problem. Thus the separation heuristic we derive for mixed knapsack sets can also be used to derive cuts for more general mixed 0-1 constraints. Initial computational results on a variety of problems are presented.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received May 22, 1997 / Revised version received December 22, 1997 Published online November 24, 1998
Rights and permissions
About this article
Cite this article
Marchand, H., Wolsey, L. The 0-1 Knapsack problem with a single continuous variable. Math. Program. 85, 15–33 (1999). https://doi.org/10.1007/s101070050044
Issue Date:
DOI: https://doi.org/10.1007/s101070050044