Abstract
We study the polyhedral structure of the monopoly polytope which arises from an integer programming formulation of dynamic monopolies in graphs. This formulation extends from the linear ordering polytope formulation. Several families of valid and facet defining inequalities are investigated. We show that (anti-) arborescences lead to families of strong valid inequalities each of which contains exponentially many facet defining inequalities. We also generalize the k-fence and Möbius ladder inequalities for the monopoly polytope.
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.
