1. On the equivalence between roof-duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems;Adams,1988
2. Nonlinear 0–1 programming: I, Linearization techniques;Balas;Math. Programming,1984
3. Nonlinear 0–1 programming: II, Dominance relations and algorithms;Balas;Math. Programming,1984
4. Chvátal cuts and odd cycle inequalities in quadratic 0–1 optimization;Boros,1989
5. Combinatorial methods for bounding a quadratic pseudo-Boolean function;Bourjolly,1988