Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 473

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

The unconstrained binary quadratic programming problem: a survey

Kochenberger, Gary, Hao, Jin-Kao, Glover, Fred, Lewis, Mark, Lü, Zhipeng, Wang, Haibo, Wang, Yang·2014·Journal of Combinatorial Optimization
DOI 10.1007/s10878-014-9734-0
Open this paper in CoChat — free account

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.1007/s10878-014-9734-0

Cites

59 of 59 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

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 59 references

Research works printed but not linked: 42

  1. Barahona F, Junger M, Reinelt G (1989) Experiments in quadratic 0–1 programming. Math Program 44:127–137 · doi:10.1007/bf01587084
  2. Cai Y, Wang J, Yin J, Zhou Y (2011) Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems. Expert Syst Appl 38(6):7817–7827. doi: 10.1016/j.eswa.2010.12.124 · doi:10.1016/j.eswa.2010.12.124
  3. Carraesi P, Malucelli F, Farinaccio F (1995) Testing optimality for quadratic 0-1 unconstrained problems. ZOR-Math Methods Oper Res 42:295–311 · doi:10.1007/bf01432506
  4. Carraesi P, Farinaccio F, Malucelli F (1999) Testing optimality for quadratic 0-1 problems. Math Program 85:407–421 · doi:10.1007/s101070050064
  5. Carter MW (1984) The indefinite zero-one quadratic problem. Discret Appl Math 7(1):23–44 · doi:10.1016/0166-218x(84)90111-2
  6. Douiri SM, Elbernouss S (2012) The unconstrained binary quadratic programming for the sum coloring problem. Mod Appl Sci 6(9):26–33. doi: 10.5539/mas.v6n9p26 · doi:10.5539/mas.v6n9p26
  7. Gulati VP, Gupta SK, Mittal AK (1984) Unconstrained quadratic bivalent programming problem. Eur J Oper Res 15(1):121–125. doi: 10.1016/0377-2217(84)90055-9 · doi:10.1016/0377-2217(84)90055-9
  8. Hansen P, Jaumard B, Mathon V (1993) State-of-the-art survey-constrained nonlinear 0-1 programming. ORSA J Comput 5(2):97–119 · doi:10.1287/ijoc.5.2.97
  9. Hansen P, Jaumard B, Meyer C (2000) Exact sequential algorithms for additive clustering. Groupe d’études et de recherche en analyse des décisions, Montréal
  10. Jeyakumar V, Rubinov AM, Wu ZY (2007) Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math Program Ser A 110:521–541. doi: 10.1007/s10107-006-0012-5 · doi:10.1007/s10107-006-0012-5
  11. Kalantari B, Bagchi A (1990) An algorithm for quadratic zero-one programs. Naval Res Logist (NRL) 37(4):527–538 · doi:10.1002/1520-6750(199008)37:4<527::aid-nav3220370407>3.0.co;2-p
  12. Katayama K, Tani M, Narihisa H (2000) Solving large binary quadratic programming problems by effective genetic local search algorithm. In: Proceedings of 2000 Genetic and Evolutionary Computation Conference, pp 643–650
  13. Kochenberger G, Alidaee B, Glover F, Wang H (2007) An effective modeling and solution approach for the generalized independent set problem. Optim Lett 1(1):111–117 · doi:10.1007/s11590-006-0007-4
  14. Kochenberger G, Glover F, Alidaee B, Wang H (2005c) Clustering of microarray data via clique partitioning. J Comb Optim 10(1):77–92 · doi:10.1007/s10878-005-1861-1
  15. Li G (2012) Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition. J Optim Theory 52:710–726. doi: 10.1007/s10957-011-9930-3 · doi:10.1007/s10957-011-9930-3
  16. Lodi A, Allemand K, Liebling TM (1999) An evolutionary heuristic for quadratic 0–1 programming. Eur J Oper Res 119(3):662–670. doi: 10.1016/S0377-2217(98)00359-2 · doi:10.1016/s0377-2217(98)00359-2
  17. Lu C, Fang A, Jin Q, Wang Z, Xing W (2011) KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J Optim 21(4):1475–1490 · doi:10.1137/100793955
  18. Lü Z, Hao J-K, Glover F (2010b) A study of memetic search with multi-parent combination for UBQP. In: Evolutionary Computation in Combinatorial Optimization. Springer, Berlin, pp 154–165 · doi:10.1007/978-3-642-12139-5_14
  19. Mauri GR, Lorena LAN (2011) Lagrangean decompositions for the unconstrained binary quadratic programming problem. Int Trans Oper Res 18(2):257–270. doi: 10.1111/j.1475-3995.2009.00743.x · doi:10.1111/j.1475-3995.2009.00743.x
  20. Mauri GR, Lorena LAN (2012a) A column generation approach for the unconstrained binary quadratic programming problem. Eur J Oper Res 217(1):69–74. doi: 10.1016/j.ejor.2011.09.016 · doi:10.1016/j.ejor.2011.09.016
  21. Mauri GR, Lorena LAN (2012b) Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. Comput Oper Res 39(7):1577–1581. doi: 10.1016/j.cor.2011.09.008 · doi:10.1016/j.cor.2011.09.008
  22. Merz P, Freisleben B (1999) Genetic algorithms for binary quadratic programming. In: Proceedings of the genetic and evolutionary computation conference, Citeseer, pp 417–424
  23. Merz P, Katayama K (2004) Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78(1–3):99–118. doi: 10.1016/j.biosystems.2004.08.002 · doi:10.1016/j.biosystems.2004.08.002
  24. Oosten M, Rutten J, Spieksma F (2001) The Clique partitioning problem: facets and patching facets. Networks 38(4):209–226 · doi:10.1002/net.10004
  25. Palubeckis G (1995) A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming. Computing 54(4):283–301. doi: 10.1007/BF02238228 · doi:10.1007/bf02238228
  26. Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2):279–296 · doi:10.15388/informatica.2006.138
  27. Palubeckis G, Tomkevicius A (2002) GRASP implementations for the unconstrained binary quadratic optimization problem. Inf Technol Control 24:14–20
  28. Pardalos PM, Jha S (1991) Graph separation techniques for quadratic zero-one programming. Comput Math Appl 21(6–7):107–113. doi: 10.1016/0898-1221(91)90165-Z · doi:10.1016/0898-1221(91)90165-z
  29. Pardalos PM, Rodgers GP (1990a) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2):131–144 · doi:10.1007/bf02247879
  30. Pardalos PM, Rodgers GP (1990b) Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann Oper Res 22(1–4):271–292 · doi:10.1007/bf02023057
  31. Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19(5):363–375. doi: 10.1016/0305-0548(92)90067-F · doi:10.1016/0305-0548(92)90067-f
  32. Pinar MC (2004) Sufficient global optimality conditions for bivalent quadratic optimization. J Optim Theory Appl 122(2):433–440 · doi:10.1023/b:jota.0000042530.24671.80
  33. Shylo V, Shylo O (2011) Systems analysis solving unconstrained binary quadratic programming problem by global equilibrium search. Cybern Syst Anal 47(6):889–897. doi: 10.1007/s10559-011-9368-5 · doi:10.1007/s10559-011-9368-5
  34. Sun XL, Liu CL, Li D, Gao JJ (2012) On duality gap in binary quadratic programming. J Global Optim 53:255–269. doi: 10.1007/s10898-011-9683-4 · doi:10.1007/s10898-011-9683-4
  35. Wang F, Xu Z (2013) Metaheuristics for robust graph coloring. J Heuristics 19(4):529–548 · doi:10.1007/s10732-011-9180-4
  36. Wang H, Alidaee B, Glover F, Kochenberger G (2006) Solving group technology problems via clique partitioning. Int J Flex Manuf Syst 18(2):77–77 · doi:10.1007/s10696-006-9011-3
  37. Wang Y, Lü Z, Glover F, Hao J-K (2012a) A multilevel algorithm for large unconstrained binary quadratic optimization. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. Springer, Berlin, pp 395–408 · doi:10.1007/978-3-642-29828-8_26
  38. Wang Y, Lü Z, Glover F, Hao J-K (2012c) Probabilistic GRASP-tabu search algorithms for the UBQP problem. Comput Oper Res 40:3100–3107 · doi:10.1016/j.cor.2011.12.006
  39. Williams HP (1985) Model building in linear and integer programming. In: Schittkowski K (ed) Computational mathematical programming, vol 15. NATO ASI Series. Springer, Berlin, pp 25–53. doi: 10.1007/978-3-642-82450-0_2 · doi:10.1007/978-3-642-82450-0_2
  40. Witzgall C (1975) Mathematical methods of site selection for Electronic Message Systems (EMS). NBS Internal report, NBS · doi:10.6028/nbs.ir.75-737
  41. Xia Y (2009) New optimality conditions for quadratic optimization problems with binary constraints. Optim Lett 3:253–263. doi: 10.1007/s11590-008-0105-6 · doi:10.1007/s11590-008-0105-6
  42. Zheng XJ, Sun XL, Li D, Xu YF (2012) On zero duality gap in nonconvex quadratic programming problems. J Global Optim 52:229–242. doi: 10.1007/s10898-011-9660-y · doi:10.1007/s10898-011-9660-y

Cited by

See all 473

Metadata

Authors
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y.
Venue
Journal of Combinatorial Optimization
Publisher
Springer Science and Business Media LLC
Published
2014-04-18
Volume
28
Issue
1
Pages
58-81
ISSN
  • 1382-6905 (ISSN-L)
  • 1573-2886
DOI
10.1007/s10878-014-9734-0
OpenAlex
W2067612530
Cited by
473
References
59
FWCI
15.28
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)

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: The unconstrained binary quadratic programming problem: a survey. https://app.cochat.ai/papers/10.1007/s10878-014-9734-0
The paper
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014). The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-014-9734-0

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.