Pınar, M. Ç.2016-02-082016-02-0820030399-0559http://hdl.handle.net/11693/24385A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemar´echal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lov´asz θ number.EnglishLagrange dualityLovász theta functionSemi-definite relaxationStable setConstraint theoryLinear programmingOptimizationProblem solvingVirtual realityLagrange dualityLovasz theta functionSemidefinite relaxationStable setsLagrange multipliersArticle10.1051/ro:20030121290-3868