Abstract
We study a linear description of PCkn the convex hull of incidence vectors of all the cycles consisting of exactly k edges (k≥4) in Kn, the complete undirected graph with n vertices. First, we describe some properties of PCkn. Second, we discuss relations between PCkn and PCk′n′ with k′>k and n′>n. Then we give three lifting algorithms that transform a facet of PCkn into facets of PCkn′ with n′>n. Finally, we provide an integer formulation and a partial linear description of PCkn.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Transactions in Operational Research
Disclaimer: 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.