Abstract
The monograph by Hammer and Rudeanu [1968] is devoted to pseudo-Boolean programming, that is, to Boolean techniques for solving optimization problems in 0–1 variables. It includes numerous applications, in particular to graph theory, among which we mention here the utilization of Boolean matrices and of free Boolean algebras in path problems, Boolean proofs of certain graph-theoretical properties and the use of Boolean equations for the determination of independent sets, dominated sets, kernels and chromatic decompositions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Rudeanu, S. (2001). Applications. In: Lattice Functions and Equations. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0241-0_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0241-0_14
Publisher Name: Springer, London
Print ISBN: 978-1-85233-266-2
Online ISBN: 978-1-4471-0241-0
eBook Packages: Springer Book Archive