The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On the copositive representation of binary and continuous nonconvex quadratic programs
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
On the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
Maxima for Graphs and a New Proof of a Theorem of Turán
Motzkin, T. S., & Straus, E. G. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-053-6 · Cited by 710
The boolean quadric polytope: Some characteristics, facets and relatives
Padberg, M. W. (1989) · Mathematical Programming · doi:10.1007/bf01589101 · Cited by 356
Approximation of the Stability Number of a Graph via Copositive Programming
de Klerk, E., & Pasechnik, D. V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401383248 · Cited by 322
On Cones of Nonnegative Quadratic Functions
Sturm, J. F., & Zhang, S. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.2.246.14485 · Cited by 319
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
Bomze, I. M., & De Klerk, E. (2002) · Journal of Global Optimization · doi:10.1023/a:1020209017701 · Cited by 219
On Copositive Programming and Standard Quadratic Optimization Problems
Bomze, I. M., Dür, M., de Klerk, E., Roos, C., Quist, A. J., & Terlaky, T. (2000) · Journal of Global Optimization · doi:10.1023/a:1026583532263 · Cited by 196
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Burer, S., & Vandenbussche, D. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0080-6 · Cited by 145
Self-citationComputing the Stability Number of a Graph Via Linear and Semidefinite Programming
Peña, J., Vera, J. C., & Zuluaga, L. F. (2007) · SIAM Journal on Optimization · doi:10.1137/05064401x · Cited by 100
An Adaptive Linear Approximation Algorithm for Copositive Programs
Bundfuss, S., & Dür, M. (2009) · SIAM Journal on Optimization · doi:10.1137/070711815 · Cited by 98
Cited by
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
Self-citationHypothalamic POMC neurons promote cannabinoid-induced feeding
Koch, M., Varela, L., Kim, J. G., Kim, J. D., Hernández-Nuño, F., Simonds, S. E., Castorena, C. M., Vianna, C. R., Elmquist, J. K., Morozov, Y. M., et al. (2015) · Nature · doi:10.1038/nature14260 · Cited by 434
An Introduction to Polynomial and Semi-Algebraic Optimization
Lasserre, J. B. (2015) · Cambridge University Press eBooks · doi:10.1017/cbo9781107447226 · Cited by 260
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Finally, a mathematically elegant reformulation of an MIP problem results in a linear programme over the dual of the cone of copositive matrices 137 .”
Metadata
- Authors
- Burer, S.
- Venue
- Mathematical Programming
- Published
- 2008-04-29
- Volume
- 120
- Issue
- 2
- Pages
- 479-495
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2078600458
- Cited by
- 388
- References
- 13
- FWCI
- 24.92
- 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: On the copositive representation of binary and continuous nonconvex quadratic programs. https://app.cochat.ai/papers/10.1007/s10107-008-0223-z
- The paper
- Burer, S. (2009). On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming. https://doi.org/10.1007/s10107-008-0223-z
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.