Abstract
In this work we consider the Lovász and Schrijver N + -rank (Lovász and Schrijver, 1991) [12] of set covering polytopes. In particular, we prove that given any positive integer number k there is a 0, 1 matrix for which the N + -rank of its set covering polyhedron and the N + -rank of the set covering polyhedron of its blocker differ by at least k . This shows the contrast between the behavior of the N + procedure and the disjunctive procedure observed in Aguilera et al. (2002) [2].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
