Skip to main content
SpringerLink
Log in

Minimization of pseudo-Boolean functions

  • Chapter
  • First Online:
Pseudo-Boolean Methods for Bivalent Programming

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 23))

  • 291 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.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. P. CAMION: Une méthode de résolution par l'algèbre de Boole des problèmes combinatoires où intervienent des entiers. Cahiers du Centre d'Etudes de Recherches Opérationnelle, 2, 234–289 (1960).

    MathSciNet  MATH  Google Scholar 

  2. M. CARVALLO: Principes et applications de l'analyse booléenne. Gauthiers-Villars, Paris, 1965.

    MATH  Google Scholar 

  3. G.B. DANTZIG: On the Significance of Solving Linear Programming Problems with Some Integer Variables. Econometrica, 28, No. 1, 30–44 (1960).

    Article  MathSciNet  MATH  Google Scholar 

  4. G.B. DANTZIG: Linear Programming and Extensions. Ch.26, Princeton University Press, Princeton, 1963.

    Book  MATH  Google Scholar 

  5. R. FORTET: L'algèbre de Boole et ses applications en recherche opérationnelle. Cahiers du Centre d'Etudes de Recherche Opérationnelle, 1, No.4, 5–36 (1959).

    MathSciNet  MATH  Google Scholar 

  6. R. FORTET: Application de l'algèbre de Boole en recherche opérationnelle. Revue Française de Recherche Opérationnelle, No. 14, 1960.

    Google Scholar 

  7. P.L. IVANESCU: Some Network Flow Problems Solved by Pseudo-Boolean Programming. Operations Research, 13, No. 3, 388–399 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  8. P.L. IVANESCU: Pseudo-Boolean Programming with Special Restraints. Applications to Graph Theory. Elektronische Informationverarbeitung und Kybernetik (EIK) 3, 167–185, (1965).

    MathSciNet  MATH  Google Scholar 

  9. P.L. IVANESCU: Dynamic Programming with Bivalent Variables. Lecture at the Symposium on Applications of Mathematics to Economics, Smolenice (Czechoslovakia) June 1965 (to appear in Publ. Inst. Math. Belgrade).

    Google Scholar 

  10. P.L. IVANESCU and I. ROSENBERG: Application of Pseudo-Boolean Programming to the Theory of Graphs. Z. Wahrscheinlichkeitstheorie, 3, No.2, 167–176 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  11. P.L. IVANESCU, I. ROSENBERG and S. RUDEANU: On the Determination of the Minima of Pseudo-Boolean Functions (in Romanian). Studii şi Cercetâri Mat., 14, No. 3, 359–364 (1963).

    MathSciNet  MATH  Google Scholar 

  12. P.L. IVANESCU, I. ROSENBERG and S. RUDEANU: An Application of Discrete Linear Programming to the Minimization of Boolean Functions (in Russian). Revue Math. Pures et Appl., 8, No. 3, 459–475 (1963).

    MathSciNet  Google Scholar 

  13. P.L. IVANESCU and S. RUDEANU: The Theory of Pseudo-Boolean Programming. I. Linear Pseudo-Boolean Equations and Inequalities. SIAM Journal (in press).

    Google Scholar 

  14. P.L. IVANESCU and S. RUDEANU: The Theory of Pseudo-Boolean Programming. II. Nonlinear Pseudo-Boolean Equations and Inequalities. SIAM Journal (in press).

    Google Scholar 

Download references

Authors
  1. P. L. Ivănescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Rudeanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1966 Springer-Verlag

About this chapter

Cite this chapter

Ivănescu, P.L., Rudeanu, S. (1966). Minimization of pseudo-Boolean functions. In: Pseudo-Boolean Methods for Bivalent Programming. Lecture Notes in Mathematics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0077207

Download citation

  • DOI: https://doi.org/10.1007/BFb0077207

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-03606-7

  • Online ISBN: 978-3-540-34835-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation