A derivation of Lovász' theta via augmented lagrange duality
Date
2003
Authors
Pınar, M. Ç.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
RAIRO - Operations Research
Print ISSN
0399-0559
Electronic ISSN
1290-3868
Publisher
E D P Sciences
Volume
37
Issue
1
Pages
17 - 27
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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.