Abstract
In this paper we consider the two-edge-connected subgraph problem with disjunctive constraints. We investigate the convex hull of the solutions to this problem. We describe several classes of valid inequalities, and discuss their facial aspect. We also devise separation routines for these inequalities. Using this, we propose a Branch-and-Cut algorithm for the problem along with an extensive computational study is presented.
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.
