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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Author information
Authors and Affiliations
Rights 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