CoChat
Sign Up
Cited by 827Complexity and Algorithms in GraphsAdvanced Optimization Algorithms ResearchAdvanced Graph Theory Research

The DOI matches its Crossref record; 159 of the 162 references it cites were found in a registry or an index.

Pseudo-Boolean optimization

Open access
Boros, Endre, Hammer, Peter L.·2002·Discrete Applied Mathematics
DOI 10.1016/s0166-218x(01)00341-9
Open this paper in CoChat — free accountOpen PDF

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0166-218x(01)00341-9

Cites

159 of 159 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 162 references

Research works printed but not linked: 17

  1. T. Badics, Approximation of some Nonlinear Binary Optimization Problems, Ph.D. Thesis, RUTCOR, Rutgers University, 1996.
  2. Balas, 1967, Extension de l'algorithme additif a la programmation en nombres at a la programmation non lineare, C. R. Acad. Sci. Paris, 258, 5136
  3. Banzhaf III, 1965, Weighted voting does not work: a mathematical analysis, Rutgers Law Rev., 19, 317
  4. Benzaken, 1983, Adjoints of pure bidirected graphs, Congr. Numer., 39, 123
  5. Fortet, 1959, L'algebre de Boole en recherche operationelle, Cahiers Études Centre Rech. Oper., 1, 5
  6. Fortet, 1960, Applications de l'algebre de Boole en recherche operationelle, Rev. Francaise Rech. Oper., 4, 17
  7. Hammer, 1968, Plant location—a pseudo-Boolean approach, Israel J. Technol., 6, 330
  8. Hammer, 1977, Pseudo-Boolean functions and game theory. I. Core elements and Shapley value, Cahiers Centre Etudes Rech. Oper., 19, 159
  9. Hammer, 1963, Application of discrete linear programming to the minimization of Boolean functions, Rev. Math. Pures Appl., 8, 459
  10. P. Hansen, B. Simeone, A class of quadratic pseudoboolean functions whose maximization is reducible to a network flow problem, CORR 79-39, Department of Comb. Optim., University of Waterloo.
  11. Laughhunn, 1971, Computational experience with capital expenditure programming models under risk, J. Business Finance, 3, 43
  12. Rosenberg, 1972, 0–1 optimization and non-linear programming, Rev. Française Automatique, Informatique Rech. Opér. (Série Bleue), 2, 95
  13. Rosenberg, 1975, Reduction of bivalent maximization to the quadratic case, Cahiers Centre Etudes Rech. Oper., 17, 71
  14. Rosenberg, 1980, Linear decompositions of positive real function of binary arguments, Utilitas Math., 17, 17
  15. I. Shepanik, Use of pseudo-boolean preference functions in metagame analysis, Ph.D. Thesis, Department of System Design, 1973.
  16. B. Simeone, Quadratic 0–1 programming, Boolean functions and graphs, Ph.D. Thesis in Combinatorics and Optimization, Waterloo, 1979.
  17. Trubin, 1969, On a method of solution of integer linear programming problems of special kind, Soviet Math. Dokl., 10, 1544

Cited by

Sorted by citations

Items 801–825 of 825

Related

See all

Metadata

Authors
Boros, E., & Hammer, P. L.
Affiliations
Rutgers, The State University of New Jersey (US)
Corresponding author
Boros, Endre
ORCID
Venue
Discrete Applied Mathematics
Publisher
Elsevier BV
Published
2002-11
Volume
123
Issue
1-3
Pages
155-225
ISSN
0166-218X (ISSN-L)
DOI
10.1016/s0166-218x(01)00341-9
OpenAlex
W2074078071
Cited by
827
References
162
Citations by year
2026: 34 · 2025: 34 · 2024: 27 · 2023: 33 · 2022: 32 · 2021: 28 · 2020: 35 · 2019: 39 · 2018: 42 · 2017: 38 · 2016: 35 · 2015: 43 · 2014: 62 · 2013: 58 · 2012: 52
FWCI
9.97
Type
journal article
Language
en
Open access
Licence
Locations
  • Discrete Applied Mathematics (publishedVersion)
  • Rutgers University Community Repository (Rutgers University) (submittedVersion)
  • ORBi (University of Liège) (submittedVersion, other-oa)
Funders
  • National Science Foundation (9806389)
  • Office of Naval Research (N00014-92-J-1375, N00014)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
Keywords
pseudo-Boolean optimization, set functions, algebraic expressions, approximation algorithms, combinatorial optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review