Titlebook: Boolean Methods in Operations Research and Related Areas; Peter L. Hammer,Sergiu Rudeanu Textbook 1968 Springer Science+Business Media New

Crater

Nonlinear Pseudo-Boolean Equations and InequalitiesIn Chapter III we have proposed a method for the determination of all the solutions of a system of . pseudo-Boolean equations and/or inequalities. The aim of this chapter is to solve the problem in case of a system of . (i.e. linear and/or nonlinear), equations and/or inequalities, as in . and . [5, 6].

GLIB

Minimization of Linear Pseudo-Boolean FunctionsThe results of the preceding two chapters will now be used in order to solve ., that is problems of minimizing (maximizing) pseudo-Boolean functions with variables possibly subject to pseudo-Boolean constraints.

MILK

SHRIK

Haphazard

Integer Mathematical ProgrammingIn this chapter we shall show that problems of:

FRAX-tool

Connectedness and Path Problems in GraphsThis chapter is concerned with the Boolean matrix approach to problems concerning the existence and determination of paths in directed graphs.

松鸡

Stable Sets, Kernels and Chromatic Decompositions of GraphsIn this chapter we shall be concerned with the problem of determining the (maximal) internally and (minimal) externally stable subsets, the kernels and the chromatic decomposition of a graph. Possible practical interpretations of these concepts are sketched in the first section, along with the necessary definitions.

heart-murmur

Flows in Networks and Chains in Partially Ordered SetsThe 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.

伪证

synovitis

https://doi.org/10.1007/978-3-642-85823-9Boolescher Verband; Management; Operations; operations research; scheduling