Persistency in Multilinear Optimization

References

• [1] Adams WP, Dearing PM (1994) On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems. Discrete Appl. Math. 48(1):1–20.Crossref, Google Scholar
• [2] Adams WP, Billionnet A, Sutter A (1990) Unconstrained 0–1 optimization and Lagrangean relaxation. Discrete Appl. Math. 29(2–3):131–142.Crossref, Google Scholar
• [3] Adams WP, Lassiter JB, Sherali HD (1998) Persistency in 0-1 polynomial programming. Math. Oper. Res. 23(2):359–389.Link, Google Scholar
• [4] Aspvall B, Plass MF, Tarjan RE (1979) A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inform. Processing Lett. 8(3):121–123.Crossref, Google Scholar
• [5] Balinski ML (1965) Integer programming: Methods, uses, computations. Management Sci. 12(3):253–313.Link, Google Scholar
• [6] Bourjolly JM (1988) An extension of the König-Egerváry property to node-weighted bidirected graphs. Math. Programming 41(1):375–384.Crossref, Google Scholar
• [7] Bourjolly JM (1990) Stable Sets, Max-Cuts and Quadratic 0-1 Optimization (Faculty of Commerce and Administration, Concordia University).Google Scholar
• [8] Dantzig G (2016) Linear Programming and Extensions (Princeton University Press, Princeton, NJ).Google Scholar
• [9] Hadavas PT (2000) Exploiting network substructures and persistency in solving 0-1 and general nonconvex optimization problems. Unpublished PhD thesis, Clemson University, SC.Google Scholar
• [10] Hammer PL, Hansen P, Simeone B (1982) Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Algebraic Discrete Methods 3(4):511–522.Crossref, Google Scholar
• [11] Hammer PL, Hansen P, Simeone B (1984) Roof duality, complementation and persistency in quadratic 0–1 optimization. Math. Programming 28(2):121–155.Crossref, Google Scholar
• [12] Hochbaum DS (1983) Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Appl. Math. 6(3):243–254.Crossref, Google Scholar
• [13] Hochbaum DS, Megiddo N, Naor JS, Tamir A (1993) Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming 62(1):69–83.Crossref, Google Scholar
• [14] Lassiter JB (1993) Persistency in 0-1 optimization. Unpublished PhD thesis, Clemson University, SC.Google Scholar
• [15] Lu S, Williams A (1987) Roof duality for polynomial 0–1 optimization. Math. Programming 37(3):357–360.Crossref, Google Scholar
• [16] Nemhauser GL, Trotter LE (1975) Vertex packings: Structural properties and algorithms. Math. Programming 8(1):232–248.Crossref, Google Scholar
• [17] Picard JC, Queyranne M (1977) On the integer-valued variables in the linear vertex packing problem. Math. Programming 12(1):97–101.Crossref, Google Scholar
• [18] Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.Crossref, Google Scholar
• [19] Sherali HD, Adams WP (1994) A hierarchy of relaxations and convex hull characterizations for mixed-integer zero–one programming problems. Discrete Appl. Math. 52(1):83–106.Crossref, Google Scholar
• [20] Sherali HD, Adams WP (2013) A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 (Springer Science & Business Media, New York).Google Scholar