Abstract
This paper is concerned with persistency properties which allow the evaluation of some variables at all maximizing points of a quadratic pseudo-Boolean function. Hammer, Hansen and Simeone (1984) have proposed to determine these variables using a procedure described by Balinski for computing a strongly complementary pair of optimal primal and dual solutions for arbitrary linear programs. We propose a linear time algorithm for determining these variables from a “best roof” off, i.e. from a lowest upper linear bound off.
This is a preview of subscription content, log in via an institution to check access.
References
M.L. Balinski, “Integer programming: Methods, uses, computation,” in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the decision sciences, Part I (American Mathematical Society, Providence, RI, 1968) pp. 179–256.
P.L. Hammer, P. Hansen and B. Simeone, “Roof duality, complementation and persistency in quadratic 0–1 optimization,”Mathematical Programming 28 (1984) 121–155.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Billionnet, A., Sutter, A. Persistency in quadratic 0–1 optimization. Mathematical Programming 54, 115–119 (1992). https://doi.org/10.1007/BF01586044
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01586044