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

DOI10.1016/j.dam.2011.07.027zbMath1259.90108OpenAlexW2021756717MaRDI QIDQ1759829

M. Susana Montelar, Mariana S. Escalante, Silvia M. Bianchi

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.027

zbMATH Keywords

circulant matrixlift-and-project operatorsstrength of facets

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Polyhedral and semidefinite programming methods in combinatorial optimization
• On the behavior of the \(N_{+}\)-operator under blocker duality
• The nonidealness index of rank-ideal matrices
• On packing and covering polyhedra of consecutive ones circulant clutters
• On the set covering polyhedron of circulant matrices
• On the facial structure of the set covering polytope
• Ideal 0, 1 matrices
• The stable set problem and the lift-and-project ranks of graphs
• Worst-case comparison of valid inequalities for the TSP
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Cones of Matrices and Set-Functions and 0–1 Optimization

This page was built for publication: Lift-and-project ranks of the set covering polytope of circulant matrices