On the Maximization of a Pseudo-Boolean Function

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the Maximization of a Pseudo-Boolean Function

Full text

Pdf (722 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 2 (April 1972) table of contents

Pages: 265 - 282

Year of Publication: 1972

ISSN:0004-5411

Authors

Peter L. Hammer	Mathematics Research Center, University of Montreal, Case Postale 6128, Montreal 101, Canada
Uri N. Peled	Israel Defense Forces, Doar Zvai 2770, Israel and faculty of Industrial and Management Engineering, Technion--Israel Insitutue of Technology, Haifa, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 29, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321694.321700 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BALAS, E. An additive algorithm for solving linear programming problems with zeroone variables. Oper. Res. IS (1965), 517-546.
	2	BERMAN, G. A branch and bound method for the maximization of a pseudo-Boolean function. Tech. Rep., Faculty of Math., U. of Waterloo, Waterloo, Ont., Canada, 1969.
	3	GEOFFRION, A.M. Integer programming by implicit enumeration and Balas' method. SIAM Re~. 9 (1967), 178-190.
	4	GLOVER, F. A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 17 (1965), 879-919.
	5	GRANOT, F., ANn HAMMER, P.L. On the use of Boolean functions in 0-1 programming. Technion, Mimeograph Ser. on Oper. Res., Statist. and Econ., Technion-Israel Inst. of Technol., Haifa, Israel, No. 70, Aug. 1970; Commun. at 7th Intern. Symp. on Mathematical Programming, The Hague, Sept. 1970.
	6	HAMMER, P.L. B-B-B methods. I.Maximization of a pseudo-Boolean function. Technion, Mimeograph Ser. on Oper. Res., Statist. and Econ., Technion-Israel Inst. of Technol., Haifa, Israel, No. 32, Feb. 1969.
	7	HAMMER, P. L., AND RUDEANU, S. Boolean Methods in Operations Research and Related Areas. Springer-Verlag, New York, 1968.
	8	HANSEN, P. Un algorithme S. E. P. pour les programmes pseudo-Booldens non liadaires. Cah. du Centre d'J~tudes de Rech. Op~rationnelle 11 (1969), 26-44.
	9	HANSON, P. A branch and bound algorithm for non-linear 0-1 programming. Lecture at the C.O.R.E., Louvain, Belgium, Feb. 1970 (mimeographed).
	10	INAGAKI, Y., AND FUKUMURA, T. Pseudo-Boolean programming with constraints. J. Inst. Elec. and Commun. Engs. Japan 50 (1967), 26-34.
	11	PELED, U. N. A computer program for maximizing a pseudo-Boolean function. Discussion Paper, Fac. of Ind. and Manag. Eng., Techaion-Israel Inst. of Technol., Half a, Israel (to appear).
	12	RUDEANU, S. Boolean equations and their applications to the study of bridge circuits. Bull. Math. Soc. Sci. Math. Phys. de la R. S. Roum. ~ (51) (1959), 445-473.
	13	RUDEANU, S. Boolean Equations. North-Holland, Amsterdam (to be published).
	14	YOSHIDA, Y., INAGAKI, Y., AND FUKUMURA, T. Algorithms of pseudo-Boolean programming based on the branch and bound method. J. Inst. Elec. and Commun. Engs. Japan 50 (1967), 277-285.

CITED BY 2

	Endre Boros , Peter L. Hammer, Pseudo-boolean optimization, Discrete Applied Mathematics, v.123 n.1-3, p.155-225, 15 November 2002
	Pramode Ranjan Bhattacharjee , Sanjoy Kumar Basu , Jogesh Chandra Paul, Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming, IEEE Transactions on Computers, v.40 n.7, p.864-867, July 1991