✦ LIBER ✦

Lift-and-project ranks of the set covering polytope of circulant matrices

✍ Scribed by Silvia M. Bianchi; Mariana S. Escalante; M. Susana Montelar

Book ID: 119225001
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 230 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the set covering polyhedron of circul

On the set covering polyhedron of circulant matrices

✍ Gabriela R. Argiroffo; Silvia M. Bianchi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 757 KB

Some advances on the set covering polyhe

Some advances on the set covering polyhedron of circulant matrices

✍ Bianchi, S.; Nasini, G.; Tolomei, P. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The stable set problem and the lift-and-

The stable set problem and the lift-and-project ranks of graphs

✍ László Lipták; Levent Tunçel 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

The minor inequalities in the descriptio

The minor inequalities in the description of the set covering polyhedron of circulant matrices

✍ Bianchi, Silvia M.; Nasini, Graciela L.; Tolomei, Paola B. 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 414 KB

On the first Chvátal closure of the set

On the first Chvátal closure of the set covering polyhedron related to circulant matrices

✍ Tolomei, Paola B.; Torres, Luis M. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Stability critical graphs and ranks face

Stability critical graphs and ranks facets of the stable set polytope

✍ E.C. Sewell; L.E. Trotter Jr. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we