Persistency in 0-1 Polynomial Programming

References

• Adams W. P. , Billionnet A. , Sutter A. Unconstrained 0-1 optimization and Lagrangean relaxation. Discrete Appl. Math. (1990) 29 131 142 Crossref, Google Scholar
• Adams W. P. , Dearing P. M. On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems. Discrete Appl. Math. (1994) 48 1 20 Crossref, Google Scholar
• Balas E. Integer and fractional matchings. Ann. Discrete Math.: Studies on Graphs and Discrete Programming (1981) 11 1 13 Crossref, Google Scholar
• Balinski M. L. Integer programming: Methods, uses, computation. Management Sci. (1965) 12 253 313 Link, Google Scholar
• Billionnet A. , Sutter A. Persistency in quadratic 0-1 optimization. Math. Programming (1992) 54 115 119 Crossref, Google Scholar
• Bourjolly J.-M. Stable sets, max-cuts and quadratic 0-1 optimization. (1990) . Working paper, Concordia University, January Google Scholar
• Hammer P. L. , Hansen P. , Simeone B. Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Alg. Disc. Meth. (1982) 3 511 522 Crossref, Google Scholar
• Hammer P. L. , Hansen P. , Simeone B. Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Programming (1984) 28 121 155 Crossref, Google Scholar
• Hochbaum D. S. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Appl. Math. (1983) 6 243 254 Crossref, Google Scholar
• Hochbaum D. S. , Megiddo N. , Naor J. , Tamir A. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming (1993) 62 69 83 Crossref, Google Scholar
• Lassiter J. B. Persistency in 0-1 optimization. (1993) . Ph.D. dissertation, Clemson University Google Scholar
• Lu S. H. , Simeone B. On the equivalence of roof-duality and paved-duality in quadratic 0-1 optimization. (1987) (Rutgers University, New Brunswick, NJ) . RUTCOR Res. Rept. #22-87 Google Scholar
• Nemhauser G. L. , Trotter L. E. Vertex packings: Structural properties and algorithms. Math. Programming (1975) 8 232 248 Crossref, Google Scholar
• Padberg M. The boolean quadric polytope: Some characteristics, facets, and relatives. Math. Programming (1989) 45 139 172 Crossref, Google Scholar
• Picard J. , Queyranne M. On the integer-valued variables in the linear vertex packing problem. Math. Programming (1977) 12 97 101 Crossref, Google Scholar
• Rhys J. M. W. A selection problem of shared fixed costs and network flows. Management Sci. (1970) 17 200 207 Link, Google Scholar
• Sherali H. D. , Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. (1990) 3 411 430 Crossref, Google Scholar
• Uhry J. P. Sur le problème du couplage maximal. R.A.I.R.O. (1975) 9 13 20 . V–3 Google Scholar