Skip to main content

Abstract

The aim of this chapter is to apply pseudo-Boolean programming to problems concerning flows in networks and minimal decompositions of partially ordered sets into chains.

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

Access this chapter

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

References

  1. After the completion of this section, we were informed about the interesting thesis of U. S. R. Mubty [1], in which pseudo-Boolean programming is applied to the solution of problems occurring in communication networks.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1968 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hammer, P.L., Rudeanu, S. (1968). Flows in Networks and Chains in Partially Ordered Sets. In: Boolean Methods in Operations Research and Related Areas. Ökonometrie und Unternehmensforschung / Econometrics and Operations Research, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85823-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85823-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85825-3

  • Online ISBN: 978-3-642-85823-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics