Boolean Methods in Operations Research and Related Areas

1. Front Matter

   Pages I-XV

   PDF

2. Introduction

   1. Introduction

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 1-2

3. Part I

   1. Boolean Algebra

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 3-22

   2. Boolean Equations

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 23-47

   3. Linear Pseudo-Boolean Equations and Inequalities

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 48-81

   4. Nonlinear Pseudo-Boolean Equations and Inequalities

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 82-101

   5. Minimization of Linear Pseudo-Boolean Functions

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 102-112

   6. Minimization of Nonlinear Pseudo-Boolean Functions

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 113-134

   7. Extensions of Pseudo-Boolean Programming

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 135-158

4. Part II

   1. Integer Mathematical Programming

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 159-171

   2. Connectedness and Path Problems in Graphs

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 172-208

   3. Stable Sets, Kernels and Chromatic Decompositions of Graphs

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 209-236

   4. Matchings of Bipartite Graphs

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 237-257

   5. Flows in Networks and Chains in Partially Ordered Sets

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 258-267

   6. Various Applications

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 268-286

   7. Minimization Problems in Automata Theory

      • Peter L. Hammer, Sergiu Rudeanu

      Pages 287-300

5. Back Matter

   Pages 301-331

   PDF

In classical analysis, there is a vast difference between the class of problems that may be handled by means of the methods of calculus and the class of problems requiring combinatorial techniques. With the advent of the digital computer, the distinction begins to blur, and with the increasing emphasis on problems involving optimization over structures, tIlE' distinction vanishes. What is necessary for the analytic and computational treatment of significant questions arising in modern control theory, mathematical economics, scheduling theory, operations research, bioengineering, and so forth is a new and more flexible mathematical theory which subsumes both the cla8sical continuous and discrete t 19orithms. The work by HAMMER (IVANESCU) and RUDEANU on Boolean methods represents an important step in this dnectlOn, and it is thus a great pleasure to welcome it into print. It will certainly stimulate a great deal of additional research in both theory and application. RICHARD BELLMAN University of Southern California FOf(,WOl'

• Boolescher Verband
• Management
• Operations
• operations research
• scheduling

• Department of Industrial and Management Engineering, TECHNION-Israel Institute of Technology, Haifa, Israel

  Peter L. Hammer

• Institute of Mathematics, Academy of S. R. Roumania, Bucharest, Romania

  Sergiu Rudeanu

Policies and ethics