Skip to main content

Minimal decomposition of finite partially ordered sets in chains

  • Part II
  • Chapter
  • First Online:
Book cover Pseudo-Boolean Programming and Applications

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 9))

  • 318 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1965 Springer-Verlag

About this chapter

Cite this chapter

Ivănescu, P.L. (1965). Minimal decomposition of finite partially ordered sets in chains. In: Pseudo-Boolean Programming and Applications. Lecture Notes in Mathematics, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073949

Download citation

  • DOI: https://doi.org/10.1007/BFb0073949

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-03352-3

  • Online ISBN: 978-3-540-37136-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics