The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827 · cited 1×
“We have seen in the introduction that any vector u satisfying (Q− diag(u)) 0 gives a new problem (Pu), defined by (3), and equivalent to our initial problem (P ), defined by (1).”
BackgroundOR-Library: Distributing Test Problems by Electronic Mail
Beasley, J. E. (1990) · Journal of the Operational Research Society · doi:10.1038/sj/jors/0411109 · Cited by 256
Cited by
The unconstrained binary quadratic programming problem: a survey
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9734-0 · Cited by 473
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“…descent (SCD) [66]; • An integer quadratic programming (IQP) model formulation solved using the commercial mathematical programming solver Gurobi [7]; • Simulated annealing (SA) [76, 16]; • A spin-vector Monte Carlo (SVMC) algorithm, which was proposed to approximate the behavior of QA [74]; •…”
MethodInfluential
Metadata
- Authors
- Billionnet, A., & Elloumi, S.
- Venue
- Mathematical Programming
- Published
- 2006-06-02
- Volume
- 109
- Issue
- 1
- Pages
- 55-68
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2050336256
- Cited by
- 182
- References
- 2
- FWCI
- 6.30
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. https://app.cochat.ai/papers/10.1007/s10107-005-0637-9
- The paper
- Billionnet, A., & Elloumi, S. (2007). Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Mathematical Programming. https://doi.org/10.1007/s10107-005-0637-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.