On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems

This publication has 8 references indexed in Scilit:

• Roof duality, complementation and persistency in quadratic 0–1 optimization
  Mathematical Programming, 1984
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
  Operations Research, 1981
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
  Operations Research, 1974
• Lagrangean relaxation for integer programming
  Published by Springer Nature ,1974
• A Selection Problem of Shared Fixed Costs and Network Flows
  Management Science, 1970
• An Improved Implicit Enumeration Approach for Integer Programming
  Operations Research, 1969
• Integer Programming: Methods, Uses, Computations
  Management Science, 1965
• Partitioning procedures for solving mixed-variables programming problems
  Numerische Mathematik, 1962