Pseudo-Boolean optimization

668Citations
Citations of this article
250Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms. © 2002 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Boros, E., & Hammer, P. L. (2002). Pseudo-Boolean optimization. Discrete Applied Mathematics, 123(1–3), 155–225. https://doi.org/10.1016/S0166-218X(01)00341-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free