A Generalization of Odd Set Inequalities for the Set Packing Problem

  • The set packing problem, sometimes also called the stable set problem, is a well-known NP-hard problem in combinatorial optimization with a wide range of applications and an interesting polyhedral structure, that has been the subject of intensive study. We contribute to this field by showing how, employing cliques, odd set inequalities for the matching problem can be generalized to valid inequalities for the set packing polytope with a clear combinatorial meaning.
Author:Olga Heismann, Ralf Borndörfer
Document Type:In Proceedings
Parent Title (English):Operations Research Proceedings 2013
First Page:193
Last Page:199
Year of first publication:2014