Skip to main content
SpringerLink
Log in

A Generalization of Odd Set Inequalities for the Set Packing Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2013

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Borndörfer, R. (1998). Aspects of set packing, partitioning, and covering, PhD thesis, TU Berlin.

    Google Scholar 

  2. Borndörfer, R., Heismann, O. (2012). The hypergraph assignment problem. Technical Report 12–14, ZIB.

    Google Scholar 

  3. Edmonds, J. (1965). Maximum matching and a polyhedron with 0, 1-vertices. Journal of Research of the National Bureau of Standards, 69, 125–130.

    Google Scholar 

  4. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness (Series of books in the mathematical sciences). San Francisco: W.H. Freeman.

    Google Scholar 

  5. Pêcher, A., & Wagler, A. (2006). Generalized clique family inequalities for claw-free graphs. Electronic Notes in Discrete Mathematics, 25, 117–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zuse Institute Berlin, Takustraße 7, 14195, Berlin, Germany

    Olga Heismann & Ralf Borndörfer

Authors
  1. Olga Heismann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Borndörfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olga Heismann .

Editor information

Editors and Affiliations

  1. Econometric Institute, Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Dennis Huisman

  2. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Ilse Louwerse

  3. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Albert P.M. Wagelmans

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Heismann, O., Borndörfer, R. (2014). A Generalization of Odd Set Inequalities for the Set Packing Problem. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_26

Download citation

Publish with us

Policies and ethics

Search

Navigation