Browsing by Subject "Stable set"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Open Access A derivation of Lovász' theta via augmented lagrange duality(E D P Sciences, 2003) Pınar, M. Ç.A 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.