The unconstrained binary quadratic programming problem: a survey

In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompas...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 28; no. 1; pp. 58 - 81
Main Authors: Kochenberger, Gary, Hao, Jin-Kao, Glover, Fred, Lewis, Mark, Lü, Zhipeng, Wang, Haibo, Wang, Yang
Format: Journal Article
Language:English
Published: Boston Springer US 01.07.2014
Springer Verlag
Subjects:
Combinatorics
Computer Science
Convex and Discrete Geometry
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Unconstrained binary quadratic programs
Combinatorial optimization
Metaheuristics
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.
AbstractList In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.
Author Wang, Yang
Kochenberger, Gary
Glover, Fred
Wang, Haibo
Lewis, Mark
Lü, Zhipeng
Hao, Jin-Kao
Author_xml – sequence: 1
  givenname: Gary
  surname: Kochenberger
  fullname: Kochenberger, Gary
  email: gary.kochenberger@ucdenver.edu
  organization: School of Business Administration, University of Colorado at Denver
– sequence: 2
  givenname: Jin-Kao
  surname: Hao
  fullname: Hao, Jin-Kao
  organization: LERIA, Université d’Angers
– sequence: 3
  givenname: Fred
  surname: Glover
  fullname: Glover, Fred
  organization: OptTek Inc
– sequence: 4
  givenname: Mark
  surname: Lewis
  fullname: Lewis, Mark
  organization: Craig School of Business, Missouri Western State University
– sequence: 5
  givenname: Zhipeng
  surname: Lü
  fullname: Lü, Zhipeng
  organization: School of Computer Science and Technology, Huazhong University of Science and Technology
– sequence: 6
  givenname: Haibo
  surname: Wang
  fullname: Wang, Haibo
  organization: Sanchez School of Business, Texas A&M International University
– sequence: 7
  givenname: Yang
  surname: Wang
  fullname: Wang, Yang
  organization: School of Management, Northwestern Polytechnical University
BackLink https://hal.science/hal-02950684$$DView record in HAL
BookMark eNp9kD1PwzAQhi1UJNrCD2DLyhA4O_5koqqAIlViKbPlJE6bKnGK3VTqv8dREANDJ7863XO-e2Zo4jpnEbrH8IgBxFPAIIVMAdNUiYymcIWmmIksJVLyScyZJClXwG7QLIQ9AMRMp-hls7NJ74rOhaM3tbNlktfO-HPy3ZvSm2NdJAffbb1p29pth5w3tn1OTBJ6f7LnW3RdmSbYu993jr7eXjfLVbr-fP9YLtZpQQk-pkzxTPBCKUUrUIxwaUlF4s6EE2IrYSoqaJnnFmIxx7jkglojmMwwyxWz2Rw9jHN3ptEHX7dxR92ZWq8Waz3UgCgGXNITjr147C18F4K31R-AQQ-69KhLR1160KUhMuIfU9THeH7nBi_NRZKMZIi_uK31et_13kUZF6Af9Yd_cA
CitedBy_id crossref_primary_10_1103_PhysRevApplied_23_014045
crossref_primary_10_1103_PhysRevApplied_18_054045
crossref_primary_10_1111_itor_13420
crossref_primary_10_1038_s41534_025_01082_1
crossref_primary_10_1186_s12859_020_3449_2
crossref_primary_10_3390_a15070224
crossref_primary_10_1002_qute_202500241
crossref_primary_10_1038_s41598_023_32232_0
crossref_primary_10_1038_s41598_025_93552_x
crossref_primary_10_1007_s42484_024_00186_9
crossref_primary_10_4213_dm1876
crossref_primary_10_1016_j_disopt_2018_06_004
crossref_primary_10_1016_j_omega_2018_07_005
crossref_primary_10_1007_s10729_025_09699_6
crossref_primary_10_1016_j_physa_2024_129990
crossref_primary_10_1080_10618600_2022_2074429
crossref_primary_10_1109_TNSE_2024_3435444
crossref_primary_10_1016_j_asoc_2021_107157
crossref_primary_10_1007_s11128_023_04058_2
crossref_primary_10_1016_j_rser_2022_112493
crossref_primary_10_1007_s10479_024_05887_9
crossref_primary_10_1016_j_ejor_2017_08_025
crossref_primary_10_1007_s13222_024_00468_3
crossref_primary_10_1109_TMC_2024_3466857
crossref_primary_10_4018_IJCINI_361012
crossref_primary_10_1155_2020_5974820
crossref_primary_10_1016_j_asoc_2019_105485
crossref_primary_10_1016_j_cor_2023_106240
crossref_primary_10_1007_s11128_024_04560_1
crossref_primary_10_1088_1741_2552_abecc4
crossref_primary_10_1103_PhysRevApplied_20_044074
crossref_primary_10_1109_LWC_2024_3425650
crossref_primary_10_3390_a12040077
crossref_primary_10_1007_s42484_023_00099_z
crossref_primary_10_1038_s41467_023_37695_3
crossref_primary_10_1109_TQE_2021_3092710
crossref_primary_10_3390_a18080516
crossref_primary_10_1007_s11432_020_3115_5
crossref_primary_10_1007_s11128_024_04518_3
crossref_primary_10_1007_s00500_018_3034_z
crossref_primary_10_3390_computers14040137
crossref_primary_10_1016_j_cor_2021_105615
crossref_primary_10_1016_j_disopt_2020_100594
crossref_primary_10_1080_02522667_2021_1930657
crossref_primary_10_3390_e25030541
crossref_primary_10_1007_s10479_022_04634_2
crossref_primary_10_1007_s10732_018_9403_z
crossref_primary_10_1103_PhysRevResearch_4_033029
crossref_primary_10_1007_s11222_023_10300_9
crossref_primary_10_1109_MNANO_2023_3249519
crossref_primary_10_2139_ssrn_3806211
crossref_primary_10_1007_s43762_022_00070_x
crossref_primary_10_1145_3747521
crossref_primary_10_1140_epjqt_s40507_022_00123_4
crossref_primary_10_1016_j_disopt_2021_100622
crossref_primary_10_1007_s42484_024_00161_4
crossref_primary_10_1007_s10732_024_09530_5
crossref_primary_10_1016_j_neucom_2019_02_009
crossref_primary_10_1109_TSG_2023_3305326
crossref_primary_10_1088_2058_9565_ac3e54
crossref_primary_10_1109_TPAMI_2020_3010811
crossref_primary_10_1016_j_orl_2019_09_009
crossref_primary_10_1038_s41598_019_47298_y
crossref_primary_10_32390_ksmer_2025_62_2_169
crossref_primary_10_1007_s00199_022_01457_x
crossref_primary_10_1007_s11128_025_04743_4
crossref_primary_10_1016_j_ipl_2023_106390
crossref_primary_10_1038_s41598_023_45668_1
crossref_primary_10_1109_TC_2023_3239539
crossref_primary_10_1109_TQE_2023_3303989
crossref_primary_10_1016_j_physrep_2024_03_002
crossref_primary_10_1016_j_disopt_2024_100858
crossref_primary_10_1103_j159_lpfx
crossref_primary_10_1103_PhysRevA_106_022423
crossref_primary_10_1103_PhysRevApplied_17_044046
crossref_primary_10_1103_PhysRevResearch_1_033142
crossref_primary_10_1016_j_cor_2025_107137
crossref_primary_10_1109_TQE_2023_3320872
crossref_primary_10_1109_TNNLS_2021_3082528
crossref_primary_10_3390_a16120557
crossref_primary_10_1007_s10955_022_03004_3
crossref_primary_10_1016_j_neucom_2016_09_122
crossref_primary_10_1016_j_future_2023_07_006
crossref_primary_10_1109_TMC_2024_3519060
crossref_primary_10_3390_ai6080175
crossref_primary_10_3390_e26100875
crossref_primary_10_3390_a12110224
crossref_primary_10_1142_S0217595920500505
crossref_primary_10_1007_s42484_025_00280_6
crossref_primary_10_1007_s42484_024_00219_3
crossref_primary_10_1007_s00158_020_02567_7
crossref_primary_10_1007_s11128_021_03405_5
crossref_primary_10_1007_s10878_025_01339_7
crossref_primary_10_1287_moor_2023_0311
crossref_primary_10_1007_s11590_018_1361_8
crossref_primary_10_1016_j_jsc_2023_102258
crossref_primary_10_3390_sym14122593
crossref_primary_10_1016_j_solener_2023_111893
crossref_primary_10_1364_JOCN_552061
crossref_primary_10_1016_j_cor_2024_106684
crossref_primary_10_3390_electronics14051027
crossref_primary_10_1371_journal_pone_0249850
crossref_primary_10_1016_j_physrep_2022_08_003
crossref_primary_10_1038_s41598_018_35416_1
crossref_primary_10_1103_PRXQuantum_5_037001
crossref_primary_10_1103_PhysRevResearch_6_033029
crossref_primary_10_1145_3678184
crossref_primary_10_1007_s42484_025_00268_2
crossref_primary_10_1287_opre_2020_1979
crossref_primary_10_1007_s44214_024_00069_x
crossref_primary_10_1016_j_cie_2017_07_012
crossref_primary_10_1109_TVT_2023_3259435
crossref_primary_10_1007_s12532_018_0147_4
crossref_primary_10_1007_s10732_021_09471_3
crossref_primary_10_1038_s41598_024_70649_3
crossref_primary_10_1007_s00453_022_01086_9
crossref_primary_10_1016_j_neucom_2019_06_111
crossref_primary_10_1038_s42256_022_00468_6
crossref_primary_10_1109_TSMC_2023_3331260
crossref_primary_10_1103_PhysRevA_111_012427
crossref_primary_10_1186_s12859_017_1869_4
crossref_primary_10_1080_03610918_2023_2266157
crossref_primary_10_1007_s10898_016_0487_4
crossref_primary_10_3390_quantum5040041
crossref_primary_10_1109_TPAMI_2016_2541146
crossref_primary_10_1038_s41540_024_00424_7
crossref_primary_10_1007_s10878_016_9990_2
crossref_primary_10_1007_s10559_016_9894_2
crossref_primary_10_1016_j_asoc_2023_110061
crossref_primary_10_1007_s10559_018_0011_6
crossref_primary_10_1109_ACCESS_2022_3197176
crossref_primary_10_1057_s41274_016_0031_4
crossref_primary_10_1007_s11590_019_01460_7
crossref_primary_10_1007_s10955_018_1984_2
crossref_primary_10_1063_5_0060481
crossref_primary_10_1007_s11063_019_10122_9
crossref_primary_10_1109_TNNLS_2022_3212593
crossref_primary_10_1007_s10479_015_2076_1
crossref_primary_10_3390_a14070194
crossref_primary_10_1111_itor_13471
crossref_primary_10_1109_TII_2024_3383908
crossref_primary_10_1109_TCI_2021_3137149
crossref_primary_10_1007_s10732_022_09498_0
crossref_primary_10_1002_qute_202300309
crossref_primary_10_1038_s41928_021_00616_7
crossref_primary_10_1007_s10107_018_1277_1
crossref_primary_10_1016_j_jmva_2018_07_014
crossref_primary_10_1038_s41598_025_13923_2
crossref_primary_10_3389_fphy_2024_1443977
crossref_primary_10_1007_s00208_025_03257_9
crossref_primary_10_1007_s11128_025_04655_3
crossref_primary_10_1016_j_physa_2018_02_119
crossref_primary_10_1109_JSTQE_2019_2929184
crossref_primary_10_1016_j_knosys_2017_11_009
crossref_primary_10_1016_j_cor_2023_106218
crossref_primary_10_1007_s10732_025_09556_3
crossref_primary_10_1103_rgyh_8xw8
crossref_primary_10_1007_s11063_018_9923_4
crossref_primary_10_3390_technologies11050143
crossref_primary_10_1016_j_cor_2019_104774
crossref_primary_10_1371_journal_pone_0259101
crossref_primary_10_3390_math11163451
crossref_primary_10_1038_s43588_025_00782_0
crossref_primary_10_1007_s10288_019_00424_y
crossref_primary_10_1016_j_chip_2024_100117
crossref_primary_10_1109_ACCESS_2024_3353222
crossref_primary_10_1287_ijoc_2021_0186
crossref_primary_10_1007_s10107_025_02274_5
crossref_primary_10_1103_PhysRevA_106_042420
crossref_primary_10_1016_j_knosys_2015_01_016
crossref_primary_10_1016_j_cor_2023_106324
crossref_primary_10_1016_j_cor_2019_104769
crossref_primary_10_1016_j_eswa_2022_116953
crossref_primary_10_1016_j_asoc_2025_113756
crossref_primary_10_1038_s44172_024_00261_w
crossref_primary_10_1016_j_swevo_2024_101540
crossref_primary_10_1016_j_ejor_2021_07_044
crossref_primary_10_1016_j_asoc_2022_109367
crossref_primary_10_1103_PRXQuantum_3_040339
crossref_primary_10_1109_TCNS_2022_3158745
crossref_primary_10_1016_j_ins_2015_07_060
crossref_primary_10_1016_j_ress_2025_111153
crossref_primary_10_1016_j_compchemeng_2023_108161
crossref_primary_10_1088_1402_4896_ad5a50
crossref_primary_10_1007_s10898_025_01523_3
crossref_primary_10_1038_s41928_020_0436_6
crossref_primary_10_1007_s42484_022_00077_x
crossref_primary_10_1088_2058_9565_ad35e4
crossref_primary_10_1109_MNANO_2024_3378483
crossref_primary_10_1007_s11814_021_1027_6
crossref_primary_10_1016_j_ifacol_2020_12_2007
crossref_primary_10_1016_j_mejo_2025_106621
crossref_primary_10_1038_s42005_021_00768_0
crossref_primary_10_3390_computers14080310
crossref_primary_10_1103_3l96_41xf
crossref_primary_10_1109_TCSI_2024_3448531
crossref_primary_10_1038_s42005_024_01870_9
crossref_primary_10_7566_JPSJ_92_124002
crossref_primary_10_1007_s00500_020_05502_6
Cites_doi 10.1155/JAMDS.2005.113
10.1016/S0166-218X(01)00341-9
10.1016/S0377-2217(97)00130-6
10.1287/mnsc.22.11.1268
10.1007/BF01587084
10.1016/j.cor.2011.09.008
10.1023/A:1017912624016
10.1007/s10898-011-9683-4
10.1016/j.orl.2004.04.014
10.1007/s10898-009-9507-y
10.1007/s10878-005-1861-1
10.1016/j.cor.2011.12.006
10.1287/ijoc.5.2.97
10.1016/0166-218X(84)90111-2
10.1007/s10559-011-9368-5
10.1007/s10898-011-9660-y
10.1287/mnsc.17.3.200
10.1016/j.ejor.2012.07.012
10.1007/BF02023057
10.1007/s10732-011-9169-z
10.1007/s10732-011-9189-8
10.1002/j.1538-7305.1970.tb01770.x
10.1007/s10696-006-9011-3
10.1287/opre.18.3.454
10.1007/BF01580072
10.1023/B:ANOR.0000039522.58036.68
10.1007/s10732-011-9171-5
10.1016/j.dam.2008.01.028
10.1080/01621459.1971.10482319
10.1007/s10957-011-9930-3
10.1007/BF02241270
10.1007/BF01098364
10.1007/s10107-006-0012-5
10.1016/0166-218X(86)90065-X
10.1007/s10732-007-9009-3
10.1007/s11590-006-0007-4
10.1023/B:JOTA.0000042530.24671.80
10.1007/s10288-009-0115-y
10.1023/A:1009877331765
10.1287/opre.36.3.493
10.1007/BF02247879
10.1016/j.ejor.2006.12.068
10.1007/BF02178370
10.1007/s11590-008-0105-6
10.1007/BF02238228
10.1007/BF02115753
10.1007/BF00139572
10.1002/net.10004
10.1016/j.biosystems.2004.08.002
10.1137/100793955
10.1016/S0377-2217(00)00242-3
10.1504/IJOR.2005.007435
10.1111/j.1475-3995.2009.00743.x
10.1016/S0377-2217(98)00359-2
10.1287/mnsc.44.3.336
10.1016/0377-2217(84)90055-9
10.1007/978-3-642-85823-9
10.1007/s101070050064
10.1016/j.ejor.2010.06.039
10.1016/j.cor.2006.04.002
10.5539/mas.v6n9p26
10.1007/s10107-005-0637-9
10.1007/s10898-009-9469-0
10.1016/j.ejor.2011.09.016
10.1016/0898-1221(91)90165-Z
10.1016/0377-2217(94)90125-2
10.1007/s10589-007-9110-4
10.1016/S0377-2217(01)00209-0
10.1504/IJOR.2009.025005
10.1137/S1052623498336930
10.1016/0167-6377(92)90043-3
10.1007/s10732-011-9180-4
10.1016/j.eswa.2011.05.060
10.1007/s10589-005-3062-3
10.1007/BF01432506
10.1016/S0167-5060(08)70343-1
10.1007/s10479-005-3449-7
10.1007/s10898-011-9713-2
10.1016/j.eswa.2010.12.124
10.1016/0305-0548(92)90067-F
10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P
10.1080/00207729408928968
10.1007/s10732-010-9128-0
10.1007/978-3-642-29828-8_26
10.15388/Informatica.2006.138
10.1007/0-387-32942-0_2
10.1007/978-1-4757-3023-4_1
10.6028/NBS.IR.75-737
10.1007/978-1-4615-5775-3_7
10.1007/978-3-642-12139-5_14
10.1007/BFb0120827
10.1007/978-3-642-82450-0_2
ContentType Journal Article
Copyright Springer Science+Business Media New York 2014
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Springer Science+Business Media New York 2014
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
DOI 10.1007/s10878-014-9734-0
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Computer Science
EISSN 1573-2886
EndPage 81
ExternalDocumentID oai:HAL:hal-02950684v1
10_1007_s10878_014_9734_0
GroupedDBID -5D
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
203
29K
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BAPOH
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
J9A
JBSCW
JCJTX
JZLTJ
KDC
KOV
LAK
LLZTM
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
OVD
P2P
P9R
PF0
PT4
PT5
QOS
R89
R9I
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S27
S3B
SAP
SDH
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7X
Z83
Z88
ZMTXR
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
GNUQQ
HCIFZ
M2P
M7S
PHGZM
PHGZT
PQGLB
PTHSS
1XC
ID FETCH-LOGICAL-c421t-596376c9994f095268e2f20872622ef7af474dbbe0208b11d674ea758315b95e3
IEDL.DBID RSV
ISICitedReferencesCount 319
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000337042900005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1382-6905
IngestDate Tue Oct 14 20:44:50 EDT 2025
Sat Nov 29 04:54:11 EST 2025
Tue Nov 18 21:58:24 EST 2025
Fri Feb 21 02:33:40 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Unconstrained binary quadratic programs
Combinatorial optimization
Metaheuristics
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c421t-596376c9994f095268e2f20872622ef7af474dbbe0208b11d674ea758315b95e3
ORCID 0000-0001-8813-4377
0000-0001-6354-9146
PageCount 24
ParticipantIDs hal_primary_oai_HAL_hal_02950684v1
crossref_primary_10_1007_s10878_014_9734_0
crossref_citationtrail_10_1007_s10878_014_9734_0
springer_journals_10_1007_s10878_014_9734_0
PublicationCentury 2000
PublicationDate 2014-07-01
PublicationDateYYYYMMDD 2014-07-01
PublicationDate_xml – month: 07
  year: 2014
  text: 2014-07-01
  day: 01
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
PublicationTitle Journal of combinatorial optimization
PublicationTitleAbbrev J Comb Optim
PublicationYear 2014
Publisher Springer US
Springer Verlag
Publisher_xml – name: Springer US
– name: Springer Verlag
References Boros, Hammer, Tavares (CR18) 2007; 13
Pardalos, Jha (CR80) 1992; 11
Hammer, Shlifer (CR32) 1971; 1
Kochenberger, Glover, Alidaee, Wang (CR50) 2005; 10
Barahona (CR6) 1986; 13
Jeyakumar, Rubinov, Wu (CR42) 2007; 110
Helmberg, Rendl (CR39) 1998; 82
Pardalos, Xue (CR85) 1994; 4
Mauri, Lorena (CR66) 2011; 18
Gueye, Michelon (CR30) 2009; 157
Palubeckis (CR76) 2006; 17
Zheng, Sun, Li, Xu (CR102) 2012; 52
Palubeckis, Tomkevicius (CR77) 2002; 24
Lewis, Kochenberger, Alidaee (CR56) 2008; 35
Kochenberger, Glover, Alidaee, Rego (CR49) 2005; 139
Lü, Hao, Glover (CR64) 2011; 17
Katayama, Narihisa (CR44) 2001; 134
Hansen, Jaumard, Mathon (CR37) 1993; 5
CR45
Wang, Xu (CR93) 2013; 19
Cai, Wang, Yin, Zhou (CR19) 2011; 38
Shylo, Shylo (CR91) 2011; 47
Carraesi, Farinaccio, Malucelli (CR21) 1999; 85
Kalantari, Bagchi (CR43) 1990; 37
Pardalos, Jha (CR79) 1991; 21
Alkhamis, Hasan, Ahmed (CR4) 1998; 108
CR57
Lodi, Allemand, Liebling (CR60) 1999; 119
Pardalos, Rodgers (CR84) 1992; 19
CR52
Hansen, Jaumard (CR36) 1990; 44
Gao, Ruan (CR25) 2010; 47
Barahona, Grotschel, Junger, Reinelt (CR7) 1988; 36
Pan, Tan, Jiang (CR78) 2008; 41
Pinar (CR88) 2004; 122
Billionnet, Elloumi (CR11) 2007; 109
Carter (CR22) 1984; 7
Wang, Lü, Glover, Hao (CR98) 2012; 40
Hansen, Jaumard, Meyer (CR38) 2000
Merz, Freisleben (CR70) 2002; 8
CR69
Oosten, Rutten, Spieksma (CR73) 2001; 38
CR63
Lewis, Alidaee, Kochenberger (CR55) 2005; 33
Li (CR59) 2012; 52
Lü, Glover, Hao (CR62) 2010; 207
Alidaee, Kochenberger, Ahmadian (CR3) 1994; 25
Douiri, Elbernouss (CR24) 2012; 6
Kernighan, Lin (CR46) 1970; 49
Glover, Alidaee, Rego, Kochenberger (CR26) 2002; 137
Pardalos, Rodgers (CR82) 1990; 45
Barahona, Junger, Reinelt (CR8) 1989; 44
Mahdavi Pajouh, Balasundaram, Prokopyev (CR65) 2013; 19
Pham Dinh, Nguyen Canh, Le Thi (CR86) 2010; 48
Rhys (CR90) 1970; 17
CR72
Huang, Pardalos, Prokopyev (CR40) 2006; 33
Hammer, Rudeanu (CR33) 1968
Carraesi, Malucelli, Farinaccio (CR20) 1995; 42
Boros, Hammer (CR16) 2002; 123
Wang, Zhou, Yin (CR95) 2011; 38
Mauri, Lorena (CR68) 2012; 39
Alidaee, Glover, Kochenberger, Rego (CR1) 2005; 2005
Kochenberger, Glover, Alidaee, Lewis (CR48) 2005; 1
Sun, Liu, Li, Gao (CR92) 2012; 53
CR5
Rao (CR89) 1971; 66
Wang, Alidaee, Glover, Kochenberger (CR94) 2006; 18
Li, Sun, Liu (CR58) 2012; 52
Merz, Katayama (CR71) 2004; 78
CR81
Billionnet, Sutter (CR12) 1994; 78
Laughhunn (CR53) 1970; 18
Beck, Teboulle (CR9) 2000; 11
Gulati, Gupta, Mittal (CR31) 1984; 15
Lewis, Alidaee, Glover, Kochenberger (CR54) 2009; 5
Iasemidis, Pardalos, Sackellares, Shiau (CR41) 2001; 5
Kochenberger, Hao, Lü, Wang, Glover (CR51) 2013; 19
CR17
Hansen (CR35) 1979; 5
Alidaee, Kochenberger, Lewis, Lewis, Wang (CR2) 2008; 186
CR14
CR13
Kochenberger, Alidaee, Glover, Wang (CR47) 2007; 1
CR99
CR10
CR96
Lu, Fang, Jin, Wang, Xing (CR61) 2011; 21
Xia (CR101) 2009; 3
Picard (CR87) 1976; 22
Pardalos, Rodgers (CR83) 1990; 22
Hanafi, Rebai, Vasquez (CR34) 2013; 19
Palubeckis (CR74) 1995; 54
Wang, Lü, Glover, Hao (CR97) 2012; 223
Glover, Kochenberger, Alidaee (CR28) 1998; 44
CR27
De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi (CR23) 1995; 80
Palubeckis (CR75) 2004; 131
Boros, Hammer (CR15) 1991; 33
CR100
Mauri, Lorena (CR67) 2012; 217
Glover, Lü, Hao (CR29) 2010; 8
9734_CR57
P Hansen (9734_CR37) 1993; 5
G Kochenberger (9734_CR48) 2005; 1
J Wang (9734_CR95) 2011; 38
C Lu (9734_CR61) 2011; 21
E Boros (9734_CR16) 2002; 123
A Billionnet (9734_CR11) 2007; 109
GA Kochenberger (9734_CR51) 2013; 19
V Shylo (9734_CR91) 2011; 47
D Gao (9734_CR25) 2010; 47
9734_CR52
F Mahdavi Pajouh (9734_CR65) 2013; 19
PM Pardalos (9734_CR83) 1990; 22
F Glover (9734_CR26) 2002; 137
H-X Huang (9734_CR40) 2006; 33
9734_CR69
PM Pardalos (9734_CR80) 1992; 11
P Merz (9734_CR71) 2004; 78
A Billionnet (9734_CR12) 1994; 78
C Simone De (9734_CR23) 1995; 80
F Barahona (9734_CR8) 1989; 44
M Lewis (9734_CR56) 2008; 35
B Alidaee (9734_CR3) 1994; 25
D Li (9734_CR58) 2012; 52
Z Lü (9734_CR62) 2010; 207
Y Xia (9734_CR101) 2009; 3
F Glover (9734_CR29) 2010; 8
9734_CR63
C Helmberg (9734_CR39) 1998; 82
9734_CR100
MC Pinar (9734_CR88) 2004; 122
A Lodi (9734_CR60) 1999; 119
M Lewis (9734_CR55) 2005; 33
TM Alkhamis (9734_CR4) 1998; 108
P Hansen (9734_CR36) 1990; 44
PM Pardalos (9734_CR85) 1994; 4
H Wang (9734_CR94) 2006; 18
M Lewis (9734_CR54) 2009; 5
MW Carter (9734_CR22) 1984; 7
J-C Picard (9734_CR87) 1976; 22
B Alidaee (9734_CR1) 2005; 2005
GR Mauri (9734_CR67) 2012; 217
9734_CR72
S Pan (9734_CR78) 2008; 41
F Wang (9734_CR93) 2013; 19
VP Gulati (9734_CR31) 1984; 15
PM Pardalos (9734_CR79) 1991; 21
E Boros (9734_CR15) 1991; 33
B Kernighan (9734_CR46) 1970; 49
G Palubeckis (9734_CR75) 2004; 131
G Kochenberger (9734_CR50) 2005; 10
P Hammer (9734_CR32) 1971; 1
V Jeyakumar (9734_CR42) 2007; 110
9734_CR81
J Rhys (9734_CR90) 1970; 17
Z Lü (9734_CR64) 2011; 17
F Barahona (9734_CR6) 1986; 13
9734_CR13
D Laughhunn (9734_CR53) 1970; 18
9734_CR14
9734_CR17
S Gueye (9734_CR30) 2009; 157
F Barahona (9734_CR7) 1988; 36
T Pham Dinh (9734_CR86) 2010; 48
G Palubeckis (9734_CR77) 2002; 24
G Palubeckis (9734_CR76) 2006; 17
9734_CR96
9734_CR99
9734_CR10
S Hanafi (9734_CR34) 2013; 19
A Beck (9734_CR9) 2000; 11
PM Pardalos (9734_CR84) 1992; 19
9734_CR27
P Hansen (9734_CR35) 1979; 5
Y Wang (9734_CR98) 2012; 40
G Kochenberger (9734_CR49) 2005; 139
M Oosten (9734_CR73) 2001; 38
PL Hammer (9734_CR33) 1968
PM Pardalos (9734_CR82) 1990; 45
P Carraesi (9734_CR20) 1995; 42
Y Cai (9734_CR19) 2011; 38
L Iasemidis (9734_CR41) 2001; 5
B Alidaee (9734_CR2) 2008; 186
9734_CR5
Y Wang (9734_CR97) 2012; 223
XJ Zheng (9734_CR102) 2012; 52
XL Sun (9734_CR92) 2012; 53
B Kalantari (9734_CR43) 1990; 37
K Katayama (9734_CR44) 2001; 134
P Carraesi (9734_CR21) 1999; 85
9734_CR45
G Palubeckis (9734_CR74) 1995; 54
F Glover (9734_CR28) 1998; 44
MR Rao (9734_CR89) 1971; 66
GR Mauri (9734_CR66) 2011; 18
G Kochenberger (9734_CR47) 2007; 1
G Li (9734_CR59) 2012; 52
P Hansen (9734_CR38) 2000
P Merz (9734_CR70) 2002; 8
SM Douiri (9734_CR24) 2012; 6
E Boros (9734_CR18) 2007; 13
GR Mauri (9734_CR68) 2012; 39
References_xml – ident: CR45
– volume: 2005
  start-page: 113
  issue: 2
  year: 2005
  end-page: 121
  ident: CR1
  article-title: A new modeling and solution approach for the number partitioning problem
  publication-title: J Appl Math Decis Sci
  doi: 10.1155/JAMDS.2005.113
– volume: 123
  start-page: 155
  issue: 1–3
  year: 2002
  end-page: 225
  ident: CR16
  article-title: Pseudo-Boolean optimization
  publication-title: Discret Appl Math
  doi: 10.1016/S0166-218X(01)00341-9
– volume: 24
  start-page: 14
  year: 2002
  end-page: 20
  ident: CR77
  article-title: GRASP implementations for the unconstrained binary quadratic optimization problem
  publication-title: Inf Technol Control
– volume: 108
  start-page: 641
  issue: 3
  year: 1998
  end-page: 652
  ident: CR4
  article-title: Simulated annealing for the unconstrained quadratic pseudo-Boolean function
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(97)00130-6
– volume: 17
  start-page: 279
  issue: 2
  year: 2006
  end-page: 296
  ident: CR76
  article-title: Iterated tabu search for the unconstrained binary quadratic optimization problem
  publication-title: Informatica
– volume: 22
  start-page: 1268
  issue: 11
  year: 1976
  end-page: 1272
  ident: CR87
  article-title: Maximal closure of a graph and applications to combinatorial problems
  publication-title: Manag Sci
  doi: 10.1287/mnsc.22.11.1268
– volume: 44
  start-page: 127
  year: 1989
  end-page: 137
  ident: CR8
  article-title: Experiments in quadratic 0–1 programming
  publication-title: Math Program
  doi: 10.1007/BF01587084
– volume: 39
  start-page: 1577
  issue: 7
  year: 2012
  end-page: 1581
  ident: CR68
  article-title: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2011.09.008
– volume: 8
  start-page: 197
  issue: 2
  year: 2002
  end-page: 213
  ident: CR70
  article-title: Greedy and local search heuristics for unconstrained binary quadratic programming
  publication-title: J Heuristics
  doi: 10.1023/A:1017912624016
– volume: 53
  start-page: 255
  year: 2012
  end-page: 269
  ident: CR92
  article-title: On duality gap in binary quadratic programming
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9683-4
– volume: 33
  start-page: 176
  issue: 2
  year: 2005
  end-page: 182
  ident: CR55
  article-title: Using xQx to model and solve the uncapacitated task allocation problem
  publication-title: Oper Res Lett
  doi: 10.1016/j.orl.2004.04.014
– volume: 48
  start-page: 595
  issue: 4
  year: 2010
  end-page: 632
  ident: CR86
  article-title: An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
  publication-title: J Global Optim
  doi: 10.1007/s10898-009-9507-y
– volume: 10
  start-page: 77
  issue: 1
  year: 2005
  end-page: 92
  ident: CR50
  article-title: Clustering of microarray data via clique partitioning
  publication-title: J Comb Optim
  doi: 10.1007/s10878-005-1861-1
– volume: 40
  start-page: 3100
  year: 2012
  end-page: 3107
  ident: CR98
  article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2011.12.006
– volume: 5
  start-page: 97
  issue: 2
  year: 1993
  end-page: 119
  ident: CR37
  article-title: State-of-the-art survey-constrained nonlinear 0-1 programming
  publication-title: ORSA J Comput
  doi: 10.1287/ijoc.5.2.97
– volume: 7
  start-page: 23
  issue: 1
  year: 1984
  end-page: 44
  ident: CR22
  article-title: The indefinite zero-one quadratic problem
  publication-title: Discret Appl Math
  doi: 10.1016/0166-218X(84)90111-2
– volume: 47
  start-page: 889
  issue: 6
  year: 2011
  end-page: 897
  ident: CR91
  article-title: Systems analysis solving unconstrained binary quadratic programming problem by global equilibrium search
  publication-title: Cybern Syst Anal
  doi: 10.1007/s10559-011-9368-5
– ident: CR57
– volume: 52
  start-page: 229
  year: 2012
  end-page: 242
  ident: CR102
  article-title: On zero duality gap in nonconvex quadratic programming problems
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9660-y
– volume: 17
  start-page: 200
  issue: 3
  year: 1970
  end-page: 207
  ident: CR90
  article-title: A selection problem of shared fixed costs and network flows
  publication-title: Manag Sci
  doi: 10.1287/mnsc.17.3.200
– ident: CR5
– volume: 223
  start-page: 595
  issue: 3
  year: 2012
  end-page: 604
  ident: CR97
  article-title: Path relinking for unconstrained binary quadratic programming
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2012.07.012
– volume: 22
  start-page: 271
  issue: 1–4
  year: 1990
  end-page: 292
  ident: CR83
  article-title: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
  publication-title: Ann Oper Res
  doi: 10.1007/BF02023057
– ident: CR100
– volume: 19
  start-page: 645
  issue: 4
  year: 2013
  end-page: 677
  ident: CR34
  article-title: Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9169-z
– volume: 19
  start-page: 565
  issue: 4
  year: 2013
  end-page: 571
  ident: CR51
  article-title: Solving large scale max cut problems via tabu search
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9189-8
– volume: 49
  start-page: 291
  year: 1970
  end-page: 307
  ident: CR46
  article-title: An eflicient heuristic procedure for partitioning graphs
  publication-title: Bell Syst Tech J
  doi: 10.1002/j.1538-7305.1970.tb01770.x
– volume: 18
  start-page: 77
  issue: 2
  year: 2006
  end-page: 77
  ident: CR94
  article-title: Solving group technology problems via clique partitioning
  publication-title: Int J Flex Manuf Syst
  doi: 10.1007/s10696-006-9011-3
– volume: 18
  start-page: 454
  issue: 3
  year: 1970
  end-page: 461
  ident: CR53
  article-title: Quadratic binary programming with application to capital-budgeting problems
  publication-title: Oper Res
  doi: 10.1287/opre.18.3.454
– ident: CR72
– volume: 82
  start-page: 291
  issue: 3
  year: 1998
  end-page: 315
  ident: CR39
  article-title: Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes
  publication-title: Math Program Ser B
  doi: 10.1007/BF01580072
– ident: CR10
– volume: 131
  start-page: 259
  issue: 1–4
  year: 2004
  end-page: 282
  ident: CR75
  article-title: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
  publication-title: Ann Oper Res
  doi: 10.1023/B:ANOR.0000039522.58036.68
– ident: CR63
– volume: 19
  start-page: 629
  issue: 4
  year: 2013
  end-page: 644
  ident: CR65
  article-title: On characterization of maximal independent sets via quadratic optimization
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9171-5
– ident: CR27
– volume: 157
  start-page: 1255
  issue: 6
  year: 2009
  end-page: 1266
  ident: CR30
  article-title: A linearization framework for unconstrained quadratic (0-1) problems
  publication-title: Discret Appl Math
  doi: 10.1016/j.dam.2008.01.028
– volume: 66
  start-page: 622
  issue: 335
  year: 1971
  end-page: 626
  ident: CR89
  article-title: Cluster analysis and mathematical programming
  publication-title: J Am Stat Assoc
  doi: 10.1080/01621459.1971.10482319
– volume: 52
  start-page: 710
  year: 2012
  end-page: 726
  ident: CR59
  article-title: Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
  publication-title: J Optim Theory
  doi: 10.1007/s10957-011-9930-3
– ident: CR69
– volume: 44
  start-page: 279
  issue: 4
  year: 1990
  end-page: 303
  ident: CR36
  article-title: Algorithms for the maximum satisfiability problem
  publication-title: Computing
  doi: 10.1007/BF02241270
– volume: 4
  start-page: 301
  issue: 3
  year: 1994
  end-page: 328
  ident: CR85
  article-title: The maximum clique problem
  publication-title: J Global Optim
  doi: 10.1007/BF01098364
– volume: 110
  start-page: 521
  year: 2007
  end-page: 541
  ident: CR42
  article-title: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
  publication-title: Math Program Ser A
  doi: 10.1007/s10107-006-0012-5
– ident: CR52
– ident: CR13
– volume: 13
  start-page: 23
  issue: 1
  year: 1986
  end-page: 26
  ident: CR6
  article-title: A solvable case of quadratic 0–1 programming
  publication-title: Discret Appl Math
  doi: 10.1016/0166-218X(86)90065-X
– volume: 13
  start-page: 99
  issue: 2
  year: 2007
  end-page: 132
  ident: CR18
  article-title: Local search heuristics for quadratic unconstrained binary optimization (QUBO)
  publication-title: J Heuristics
  doi: 10.1007/s10732-007-9009-3
– volume: 1
  start-page: 111
  issue: 1
  year: 2007
  end-page: 117
  ident: CR47
  article-title: An effective modeling and solution approach for the generalized independent set problem
  publication-title: Optim Lett
  doi: 10.1007/s11590-006-0007-4
– volume: 122
  start-page: 433
  issue: 2
  year: 2004
  end-page: 440
  ident: CR88
  article-title: Sufficient global optimality conditions for bivalent quadratic optimization
  publication-title: J Optim Theory Appl
  doi: 10.1023/B:JOTA.0000042530.24671.80
– volume: 8
  start-page: 239
  issue: 3
  year: 2010
  end-page: 253
  ident: CR29
  article-title: Diversification-driven tabu search for unconstrained binary quadratic problems
  publication-title: 4OR
  doi: 10.1007/s10288-009-0115-y
– volume: 5
  start-page: 9
  issue: 1
  year: 2001
  end-page: 26
  ident: CR41
  article-title: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
  publication-title: J Comb Optim
  doi: 10.1023/A:1009877331765
– volume: 36
  start-page: 493
  issue: 3
  year: 1988
  ident: CR7
  article-title: An application of combinatorial optimization to statistical
  publication-title: Oper Res
  doi: 10.1287/opre.36.3.493
– volume: 45
  start-page: 131
  issue: 2
  year: 1990
  end-page: 144
  ident: CR82
  article-title: Computational aspects of a branch and bound algorithm for quadratic zero-one programming
  publication-title: Computing
  doi: 10.1007/BF02247879
– volume: 186
  start-page: 504
  issue: 2
  year: 2008
  end-page: 512
  ident: CR2
  article-title: A new approach for modeling and solving set packing problems
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2006.12.068
– volume: 80
  start-page: 487
  issue: 1–2
  year: 1995
  end-page: 496
  ident: CR23
  article-title: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
  publication-title: J Stat Phys
  doi: 10.1007/BF02178370
– volume: 3
  start-page: 253
  year: 2009
  end-page: 263
  ident: CR101
  article-title: New optimality conditions for quadratic optimization problems with binary constraints
  publication-title: Optim Lett
  doi: 10.1007/s11590-008-0105-6
– volume: 54
  start-page: 283
  issue: 4
  year: 1995
  end-page: 301
  ident: CR74
  article-title: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
  publication-title: Computing
  doi: 10.1007/BF02238228
– volume: 33
  start-page: 151
  issue: 1–4
  year: 1991
  end-page: 180
  ident: CR15
  article-title: The max-cut problem and quadratic 0–1 optimization polyhedral aspects, relaxations and bounds
  publication-title: Ann Oper Res
  doi: 10.1007/BF02115753
– volume: 1
  start-page: 296
  issue: 3
  year: 1971
  end-page: 308
  ident: CR32
  article-title: Applications of pseudo-Boolean methods to economic problems
  publication-title: Theor Decis
  doi: 10.1007/BF00139572
– volume: 38
  start-page: 209
  issue: 4
  year: 2001
  end-page: 226
  ident: CR73
  article-title: The Clique partitioning problem: facets and patching facets
  publication-title: Networks
  doi: 10.1002/net.10004
– volume: 78
  start-page: 99
  issue: 1–3
  year: 2004
  end-page: 118
  ident: CR71
  article-title: Memetic algorithms for the unconstrained binary quadratic programming problem
  publication-title: Biosystems
  doi: 10.1016/j.biosystems.2004.08.002
– volume: 21
  start-page: 1475
  issue: 4
  year: 2011
  end-page: 1490
  ident: CR61
  article-title: KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
  publication-title: SIAM J Optim
  doi: 10.1137/100793955
– volume: 134
  start-page: 103
  issue: 1
  year: 2001
  end-page: 119
  ident: CR44
  article-title: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(00)00242-3
– volume: 1
  start-page: 89
  issue: 1
  year: 2005
  end-page: 100
  ident: CR48
  article-title: Using the unconstrained quadratic program to model and solve Max 2-SAT problems
  publication-title: Int J Oper Res
  doi: 10.1504/IJOR.2005.007435
– volume: 18
  start-page: 257
  issue: 2
  year: 2011
  end-page: 270
  ident: CR66
  article-title: Lagrangean decompositions for the unconstrained binary quadratic programming problem
  publication-title: Int Trans Oper Res
  doi: 10.1111/j.1475-3995.2009.00743.x
– volume: 119
  start-page: 662
  issue: 3
  year: 1999
  end-page: 670
  ident: CR60
  article-title: An evolutionary heuristic for quadratic 0–1 programming
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(98)00359-2
– volume: 44
  start-page: 336
  issue: 3
  year: 1998
  end-page: 345
  ident: CR28
  article-title: Adaptive memory tabu search for binary quadratic programs
  publication-title: Manag Sci
  doi: 10.1287/mnsc.44.3.336
– volume: 15
  start-page: 121
  issue: 1
  year: 1984
  end-page: 125
  ident: CR31
  article-title: Unconstrained quadratic bivalent programming problem
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(84)90055-9
– year: 1968
  ident: CR33
  publication-title: Boolean methods in operations research and related areas
  doi: 10.1007/978-3-642-85823-9
– volume: 85
  start-page: 407
  year: 1999
  end-page: 421
  ident: CR21
  article-title: Testing optimality for quadratic 0-1 problems
  publication-title: Math Program
  doi: 10.1007/s101070050064
– volume: 207
  start-page: 1254
  issue: 3
  year: 2010
  end-page: 1262
  ident: CR62
  article-title: A hybrid metaheuristic approach to solving the UBQP problem
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2010.06.039
– ident: CR96
– volume: 35
  start-page: 807
  issue: 3
  year: 2008
  end-page: 813
  ident: CR56
  article-title: A new modeling and solution approach for the set-partitioning problem
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2006.04.002
– volume: 6
  start-page: 26
  issue: 9
  year: 2012
  end-page: 33
  ident: CR24
  article-title: The unconstrained binary quadratic programming for the sum coloring problem
  publication-title: Mod Appl Sci
  doi: 10.5539/mas.v6n9p26
– volume: 109
  start-page: 55
  issue: 1
  year: 2007
  end-page: 68
  ident: CR11
  article-title: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0–1 problem
  publication-title: Math Program
  doi: 10.1007/s10107-005-0637-9
– ident: CR81
– volume: 47
  start-page: 463
  year: 2010
  end-page: 484
  ident: CR25
  article-title: Solutions to quadratic minimization problems with box and integer constraints
  publication-title: J Global Optim
  doi: 10.1007/s10898-009-9469-0
– volume: 217
  start-page: 69
  issue: 1
  year: 2012
  end-page: 74
  ident: CR67
  article-title: A column generation approach for the unconstrained binary quadratic programming problem
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2011.09.016
– ident: CR99
– volume: 21
  start-page: 107
  issue: 6–7
  year: 1991
  end-page: 113
  ident: CR79
  article-title: Graph separation techniques for quadratic zero-one programming
  publication-title: Comput Math Appl
  doi: 10.1016/0898-1221(91)90165-Z
– volume: 78
  start-page: 106
  issue: 1
  year: 1994
  end-page: 115
  ident: CR12
  article-title: Minimization of a quadratic pseudo-Boolean function
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(94)90125-2
– year: 2000
  ident: CR38
  publication-title: Exact sequential algorithms for additive clustering
– volume: 41
  start-page: 349
  issue: 3
  year: 2008
  end-page: 362
  ident: CR78
  article-title: A global continuation algorithm for solving binary quadratic programming problems
  publication-title: Comput Optim Appl
  doi: 10.1007/s10589-007-9110-4
– volume: 137
  start-page: 272
  issue: 2
  year: 2002
  end-page: 287
  ident: CR26
  article-title: One-pass heuristics for large-scale unconstrained binary quadratic problems
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(01)00209-0
– volume: 5
  start-page: 152
  issue: 2
  year: 2009
  end-page: 162
  ident: CR54
  article-title: A note on xQx as a modelling and solution framework for the Linear Ordering Problem
  publication-title: Int J Oper Res
  doi: 10.1504/IJOR.2009.025005
– volume: 11
  start-page: 179
  issue: 1
  year: 2000
  end-page: 188
  ident: CR9
  article-title: Global optimality conditions for quadratic optimization problems with binary constraints
  publication-title: SIAM J Optim
  doi: 10.1137/S1052623498336930
– ident: CR14
– volume: 11
  start-page: 119
  issue: 2
  year: 1992
  end-page: 123
  ident: CR80
  article-title: Complexity of uniqueness and local search in quadratic 0-1 programming
  publication-title: Oper Res Lett
  doi: 10.1016/0167-6377(92)90043-3
– volume: 19
  start-page: 529
  issue: 4
  year: 2013
  end-page: 548
  ident: CR93
  article-title: Metaheuristics for robust graph coloring
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9180-4
– volume: 38
  start-page: 14870
  issue: 12
  year: 2011
  end-page: 14881
  ident: CR95
  article-title: Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2011.05.060
– volume: 33
  start-page: 187
  issue: 2–3
  year: 2006
  end-page: 208
  ident: CR40
  article-title: Lower bound improvement and forcing rule for quadratic binary programming
  publication-title: Comput Optim Appl
  doi: 10.1007/s10589-005-3062-3
– volume: 42
  start-page: 295
  year: 1995
  end-page: 311
  ident: CR20
  article-title: Testing optimality for quadratic 0-1 unconstrained problems
  publication-title: ZOR-Math Methods Oper Res
  doi: 10.1007/BF01432506
– volume: 5
  start-page: 53
  year: 1979
  end-page: 70
  ident: CR35
  article-title: Methods of nonlinear 0-1 programming
  publication-title: Ann Discret Math
  doi: 10.1016/S0167-5060(08)70343-1
– volume: 139
  start-page: 229
  issue: 1–4
  year: 2005
  end-page: 241
  ident: CR49
  article-title: An unconstrained quadratic binary programming approach to the vertex coloring problem
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-005-3449-7
– ident: CR17
– volume: 52
  start-page: 797
  issue: 4
  year: 2012
  end-page: 829
  ident: CR58
  article-title: An exact solution method for unconstrained quadratic 0 1 programming: a geometric approach
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9713-2
– volume: 38
  start-page: 7817
  issue: 6
  year: 2011
  end-page: 7827
  ident: CR19
  article-title: Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2010.12.124
– volume: 19
  start-page: 363
  issue: 5
  year: 1992
  end-page: 375
  ident: CR84
  article-title: A branch and bound algorithm for the maximum clique problem
  publication-title: Comput Oper Res
  doi: 10.1016/0305-0548(92)90067-F
– volume: 37
  start-page: 527
  issue: 4
  year: 1990
  end-page: 538
  ident: CR43
  article-title: An algorithm for quadratic zero-one programs
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P
– volume: 25
  start-page: 401
  issue: 2
  year: 1994
  end-page: 408
  ident: CR3
  article-title: 0–1 Quadratic programming approach for optimum solutions of two scheduling problems
  publication-title: Int J Syst Sci
  doi: 10.1080/00207729408928968
– volume: 17
  start-page: 97
  issue: 2
  year: 2011
  end-page: 118
  ident: CR64
  article-title: Neighborhood analysis: a case study on curriculum-based course timetabling
  publication-title: J Heuristics
  doi: 10.1007/s10732-010-9128-0
– volume: 1
  start-page: 111
  issue: 1
  year: 2007
  ident: 9734_CR47
  publication-title: Optim Lett
  doi: 10.1007/s11590-006-0007-4
– volume: 33
  start-page: 151
  issue: 1–4
  year: 1991
  ident: 9734_CR15
  publication-title: Ann Oper Res
  doi: 10.1007/BF02115753
– ident: 9734_CR17
– volume: 123
  start-page: 155
  issue: 1–3
  year: 2002
  ident: 9734_CR16
  publication-title: Discret Appl Math
  doi: 10.1016/S0166-218X(01)00341-9
– ident: 9734_CR96
  doi: 10.1007/978-3-642-29828-8_26
– ident: 9734_CR69
– volume: 53
  start-page: 255
  year: 2012
  ident: 9734_CR92
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9683-4
– volume: 5
  start-page: 9
  issue: 1
  year: 2001
  ident: 9734_CR41
  publication-title: J Comb Optim
  doi: 10.1023/A:1009877331765
– volume: 38
  start-page: 209
  issue: 4
  year: 2001
  ident: 9734_CR73
  publication-title: Networks
  doi: 10.1002/net.10004
– volume: 17
  start-page: 279
  issue: 2
  year: 2006
  ident: 9734_CR76
  publication-title: Informatica
  doi: 10.15388/Informatica.2006.138
– volume: 17
  start-page: 200
  issue: 3
  year: 1970
  ident: 9734_CR90
  publication-title: Manag Sci
  doi: 10.1287/mnsc.17.3.200
– volume: 21
  start-page: 1475
  issue: 4
  year: 2011
  ident: 9734_CR61
  publication-title: SIAM J Optim
  doi: 10.1137/100793955
– volume: 122
  start-page: 433
  issue: 2
  year: 2004
  ident: 9734_CR88
  publication-title: J Optim Theory Appl
  doi: 10.1023/B:JOTA.0000042530.24671.80
– volume: 19
  start-page: 629
  issue: 4
  year: 2013
  ident: 9734_CR65
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9171-5
– volume: 7
  start-page: 23
  issue: 1
  year: 1984
  ident: 9734_CR22
  publication-title: Discret Appl Math
  doi: 10.1016/0166-218X(84)90111-2
– volume: 8
  start-page: 197
  issue: 2
  year: 2002
  ident: 9734_CR70
  publication-title: J Heuristics
  doi: 10.1023/A:1017912624016
– volume: 47
  start-page: 463
  year: 2010
  ident: 9734_CR25
  publication-title: J Global Optim
  doi: 10.1007/s10898-009-9469-0
– volume: 10
  start-page: 77
  issue: 1
  year: 2005
  ident: 9734_CR50
  publication-title: J Comb Optim
  doi: 10.1007/s10878-005-1861-1
– volume: 157
  start-page: 1255
  issue: 6
  year: 2009
  ident: 9734_CR30
  publication-title: Discret Appl Math
  doi: 10.1016/j.dam.2008.01.028
– volume: 78
  start-page: 99
  issue: 1–3
  year: 2004
  ident: 9734_CR71
  publication-title: Biosystems
  doi: 10.1016/j.biosystems.2004.08.002
– volume: 186
  start-page: 504
  issue: 2
  year: 2008
  ident: 9734_CR2
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2006.12.068
– volume: 137
  start-page: 272
  issue: 2
  year: 2002
  ident: 9734_CR26
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(01)00209-0
– volume: 5
  start-page: 97
  issue: 2
  year: 1993
  ident: 9734_CR37
  publication-title: ORSA J Comput
  doi: 10.1287/ijoc.5.2.97
– volume: 42
  start-page: 295
  year: 1995
  ident: 9734_CR20
  publication-title: ZOR-Math Methods Oper Res
  doi: 10.1007/BF01432506
– volume: 13
  start-page: 23
  issue: 1
  year: 1986
  ident: 9734_CR6
  publication-title: Discret Appl Math
  doi: 10.1016/0166-218X(86)90065-X
– ident: 9734_CR5
– volume: 80
  start-page: 487
  issue: 1–2
  year: 1995
  ident: 9734_CR23
  publication-title: J Stat Phys
  doi: 10.1007/BF02178370
– volume: 5
  start-page: 152
  issue: 2
  year: 2009
  ident: 9734_CR54
  publication-title: Int J Oper Res
  doi: 10.1504/IJOR.2009.025005
– volume: 44
  start-page: 127
  year: 1989
  ident: 9734_CR8
  publication-title: Math Program
  doi: 10.1007/BF01587084
– volume: 108
  start-page: 641
  issue: 3
  year: 1998
  ident: 9734_CR4
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(97)00130-6
– volume: 33
  start-page: 176
  issue: 2
  year: 2005
  ident: 9734_CR55
  publication-title: Oper Res Lett
  doi: 10.1016/j.orl.2004.04.014
– volume: 4
  start-page: 301
  issue: 3
  year: 1994
  ident: 9734_CR85
  publication-title: J Global Optim
  doi: 10.1007/BF01098364
– volume: 19
  start-page: 529
  issue: 4
  year: 2013
  ident: 9734_CR93
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9180-4
– volume: 2005
  start-page: 113
  issue: 2
  year: 2005
  ident: 9734_CR1
  publication-title: J Appl Math Decis Sci
  doi: 10.1155/JAMDS.2005.113
– ident: 9734_CR81
  doi: 10.1007/0-387-32942-0_2
– volume: 139
  start-page: 229
  issue: 1–4
  year: 2005
  ident: 9734_CR49
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-005-3449-7
– volume: 78
  start-page: 106
  issue: 1
  year: 1994
  ident: 9734_CR12
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(94)90125-2
– volume: 38
  start-page: 7817
  issue: 6
  year: 2011
  ident: 9734_CR19
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2010.12.124
– volume: 44
  start-page: 336
  issue: 3
  year: 1998
  ident: 9734_CR28
  publication-title: Manag Sci
  doi: 10.1287/mnsc.44.3.336
– volume: 52
  start-page: 229
  year: 2012
  ident: 9734_CR102
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9660-y
– volume: 18
  start-page: 454
  issue: 3
  year: 1970
  ident: 9734_CR53
  publication-title: Oper Res
  doi: 10.1287/opre.18.3.454
– volume: 22
  start-page: 271
  issue: 1–4
  year: 1990
  ident: 9734_CR83
  publication-title: Ann Oper Res
  doi: 10.1007/BF02023057
– volume: 37
  start-page: 527
  issue: 4
  year: 1990
  ident: 9734_CR43
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P
– volume: 18
  start-page: 77
  issue: 2
  year: 2006
  ident: 9734_CR94
  publication-title: Int J Flex Manuf Syst
  doi: 10.1007/s10696-006-9011-3
– volume: 38
  start-page: 14870
  issue: 12
  year: 2011
  ident: 9734_CR95
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2011.05.060
– ident: 9734_CR14
– volume: 223
  start-page: 595
  issue: 3
  year: 2012
  ident: 9734_CR97
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2012.07.012
– volume: 40
  start-page: 3100
  year: 2012
  ident: 9734_CR98
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2011.12.006
– ident: 9734_CR13
  doi: 10.1007/978-1-4757-3023-4_1
– volume-title: Boolean methods in operations research and related areas
  year: 1968
  ident: 9734_CR33
  doi: 10.1007/978-3-642-85823-9
– volume: 19
  start-page: 363
  issue: 5
  year: 1992
  ident: 9734_CR84
  publication-title: Comput Oper Res
  doi: 10.1016/0305-0548(92)90067-F
– volume: 24
  start-page: 14
  year: 2002
  ident: 9734_CR77
  publication-title: Inf Technol Control
– ident: 9734_CR45
– volume: 11
  start-page: 179
  issue: 1
  year: 2000
  ident: 9734_CR9
  publication-title: SIAM J Optim
  doi: 10.1137/S1052623498336930
– ident: 9734_CR100
  doi: 10.6028/NBS.IR.75-737
– volume: 33
  start-page: 187
  issue: 2–3
  year: 2006
  ident: 9734_CR40
  publication-title: Comput Optim Appl
  doi: 10.1007/s10589-005-3062-3
– volume: 45
  start-page: 131
  issue: 2
  year: 1990
  ident: 9734_CR82
  publication-title: Computing
  doi: 10.1007/BF02247879
– volume: 49
  start-page: 291
  year: 1970
  ident: 9734_CR46
  publication-title: Bell Syst Tech J
  doi: 10.1002/j.1538-7305.1970.tb01770.x
– volume: 52
  start-page: 797
  issue: 4
  year: 2012
  ident: 9734_CR58
  publication-title: J Global Optim
  doi: 10.1007/s10898-011-9713-2
– volume: 119
  start-page: 662
  issue: 3
  year: 1999
  ident: 9734_CR60
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(98)00359-2
– volume: 15
  start-page: 121
  issue: 1
  year: 1984
  ident: 9734_CR31
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(84)90055-9
– volume: 3
  start-page: 253
  year: 2009
  ident: 9734_CR101
  publication-title: Optim Lett
  doi: 10.1007/s11590-008-0105-6
– ident: 9734_CR27
  doi: 10.1007/978-1-4615-5775-3_7
– volume: 207
  start-page: 1254
  issue: 3
  year: 2010
  ident: 9734_CR62
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2010.06.039
– ident: 9734_CR63
  doi: 10.1007/978-3-642-12139-5_14
– volume: 35
  start-page: 807
  issue: 3
  year: 2008
  ident: 9734_CR56
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2006.04.002
– volume: 36
  start-page: 493
  issue: 3
  year: 1988
  ident: 9734_CR7
  publication-title: Oper Res
  doi: 10.1287/opre.36.3.493
– volume-title: Exact sequential algorithms for additive clustering
  year: 2000
  ident: 9734_CR38
– volume: 48
  start-page: 595
  issue: 4
  year: 2010
  ident: 9734_CR86
  publication-title: J Global Optim
  doi: 10.1007/s10898-009-9507-y
– volume: 19
  start-page: 565
  issue: 4
  year: 2013
  ident: 9734_CR51
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9189-8
– volume: 134
  start-page: 103
  issue: 1
  year: 2001
  ident: 9734_CR44
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(00)00242-3
– volume: 8
  start-page: 239
  issue: 3
  year: 2010
  ident: 9734_CR29
  publication-title: 4OR
  doi: 10.1007/s10288-009-0115-y
– volume: 19
  start-page: 645
  issue: 4
  year: 2013
  ident: 9734_CR34
  publication-title: J Heuristics
  doi: 10.1007/s10732-011-9169-z
– volume: 5
  start-page: 53
  year: 1979
  ident: 9734_CR35
  publication-title: Ann Discret Math
  doi: 10.1016/S0167-5060(08)70343-1
– volume: 47
  start-page: 889
  issue: 6
  year: 2011
  ident: 9734_CR91
  publication-title: Cybern Syst Anal
  doi: 10.1007/s10559-011-9368-5
– volume: 6
  start-page: 26
  issue: 9
  year: 2012
  ident: 9734_CR24
  publication-title: Mod Appl Sci
  doi: 10.5539/mas.v6n9p26
– volume: 131
  start-page: 259
  issue: 1–4
  year: 2004
  ident: 9734_CR75
  publication-title: Ann Oper Res
  doi: 10.1023/B:ANOR.0000039522.58036.68
– ident: 9734_CR57
– volume: 11
  start-page: 119
  issue: 2
  year: 1992
  ident: 9734_CR80
  publication-title: Oper Res Lett
  doi: 10.1016/0167-6377(92)90043-3
– volume: 17
  start-page: 97
  issue: 2
  year: 2011
  ident: 9734_CR64
  publication-title: J Heuristics
  doi: 10.1007/s10732-010-9128-0
– volume: 41
  start-page: 349
  issue: 3
  year: 2008
  ident: 9734_CR78
  publication-title: Comput Optim Appl
  doi: 10.1007/s10589-007-9110-4
– volume: 110
  start-page: 521
  year: 2007
  ident: 9734_CR42
  publication-title: Math Program Ser A
  doi: 10.1007/s10107-006-0012-5
– volume: 66
  start-page: 622
  issue: 335
  year: 1971
  ident: 9734_CR89
  publication-title: J Am Stat Assoc
  doi: 10.1080/01621459.1971.10482319
– volume: 52
  start-page: 710
  year: 2012
  ident: 9734_CR59
  publication-title: J Optim Theory
  doi: 10.1007/s10957-011-9930-3
– volume: 44
  start-page: 279
  issue: 4
  year: 1990
  ident: 9734_CR36
  publication-title: Computing
  doi: 10.1007/BF02241270
– volume: 1
  start-page: 89
  issue: 1
  year: 2005
  ident: 9734_CR48
  publication-title: Int J Oper Res
  doi: 10.1504/IJOR.2005.007435
– volume: 21
  start-page: 107
  issue: 6–7
  year: 1991
  ident: 9734_CR79
  publication-title: Comput Math Appl
  doi: 10.1016/0898-1221(91)90165-Z
– volume: 13
  start-page: 99
  issue: 2
  year: 2007
  ident: 9734_CR18
  publication-title: J Heuristics
  doi: 10.1007/s10732-007-9009-3
– volume: 25
  start-page: 401
  issue: 2
  year: 1994
  ident: 9734_CR3
  publication-title: Int J Syst Sci
  doi: 10.1080/00207729408928968
– volume: 18
  start-page: 257
  issue: 2
  year: 2011
  ident: 9734_CR66
  publication-title: Int Trans Oper Res
  doi: 10.1111/j.1475-3995.2009.00743.x
– volume: 22
  start-page: 1268
  issue: 11
  year: 1976
  ident: 9734_CR87
  publication-title: Manag Sci
  doi: 10.1287/mnsc.22.11.1268
– volume: 39
  start-page: 1577
  issue: 7
  year: 2012
  ident: 9734_CR68
  publication-title: Comput Oper Res
  doi: 10.1016/j.cor.2011.09.008
– ident: 9734_CR10
– volume: 109
  start-page: 55
  issue: 1
  year: 2007
  ident: 9734_CR11
  publication-title: Math Program
  doi: 10.1007/s10107-005-0637-9
– volume: 217
  start-page: 69
  issue: 1
  year: 2012
  ident: 9734_CR67
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2011.09.016
– volume: 54
  start-page: 283
  issue: 4
  year: 1995
  ident: 9734_CR74
  publication-title: Computing
  doi: 10.1007/BF02238228
– ident: 9734_CR52
  doi: 10.1007/BFb0120827
– ident: 9734_CR99
  doi: 10.1007/978-3-642-82450-0_2
– ident: 9734_CR72
– volume: 85
  start-page: 407
  year: 1999
  ident: 9734_CR21
  publication-title: Math Program
  doi: 10.1007/s101070050064
– volume: 1
  start-page: 296
  issue: 3
  year: 1971
  ident: 9734_CR32
  publication-title: Theor Decis
  doi: 10.1007/BF00139572
– volume: 82
  start-page: 291
  issue: 3
  year: 1998
  ident: 9734_CR39
  publication-title: Math Program Ser B
  doi: 10.1007/BF01580072
SSID ssj0009054
Score 2.5414453
Snippet In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application...
SourceID hal
crossref
springer
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 58
SubjectTerms Combinatorics
Computer Science
Convex and Discrete Geometry
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Title The unconstrained binary quadratic programming problem: a survey
URI https://link.springer.com/article/10.1007/s10878-014-9734-0
https://hal.science/hal-02950684
Volume 28
WOSCitedRecordID wos000337042900005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: RSV
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA86fdAHv8X5RRCflEKTpmnqk0Mce9AhfrG30qQXFHTqug3877107TZFBX1sSUJ6H7077u53hBwGAJaZCIU3FqknAkCdi0F6mS9QQozVOlXFsImo3VadTnxV9nHnVbV7lZIs_tRTzW7KocEy4cVRIDyM0-fQ2imnjdc39xOkXT8cTbJF1xFDv7BKZX53xCdjNPvgSiG_5EMLM9Nc_tcFV8hS6VXSxkgMVskMdNfI4hTWID5djgFa83VyiuJB0aQ579ANiYCM6qIzl74N0sxJhaFl6dYzbqfl3JkTmtJ80BvC-wa5a57fnrW8cpiCZwRnfS9ETYukQX9QWHSruFTALccbc8k52Ci1IhKZ1uCmdmrGMhkJSDGaCFio4xCCTVLrvnRhi1ApINPoRiiDwUhghLJcW20FQ9tmZWrqxK-ompgSadx9y1MywUh2pEqQVIkjVeLXydF4y-sIZuO3xQfIqvE6B5Ddalwk7p3P49CXSgxZnRxXXEpKtcx_PnL7T6t3yAJ3bC6qdndJrd8bwB6ZN8P-Y97bL8TxA_YW1zg
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD3-L8DOKTUmjTNG19cohj4jZEp_gWmjRBQaeu28D_3kvXzg9U0MeWJKT30bvj7n4HsO9rbTwVovDGLHGYr1HnYs2d1GUoIcpImUT5sImw3Y5ub-OLoo87K6vdy5Rk_qf-0OwWWTRYjzlx6DMH4_QphgbL1vFdXt28I-26wWiSLbqOGPoFZSrzuyM-GaPJO1sK-SUfmpuZ-sK_LrgI84VXSWojMViCCd1dhrkPWIP41BoDtGYrcIziQdCkWe_QDonQKZF5Zy55GSSplQpFitKtR9xOirkzRyQh2aA31K-rcF0_7Zw0nGKYgqOQSn0nQE0LuUJ_kBl0qyiPNDUUb0w5pdqEiWEhS6XUdmqn9LyUh0wnGE34XiDjQPtrUOk-dfU6EM50KtGNiBQGI75ikaHSSMM8tG2GJ6oKbklVoQqkcfstD-IdI9mSSiCphCWVcKtwMN7yPILZ-G3xHrJqvM4CZDdqTWHfuTQOXB6xoVeFw5JLolDL7OcjN_60ehdmGp1WUzTP2uebMEsty_MK3i2o9HsDvQ3Tati_z3o7uWi-ARXC2hw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA86RfTBb3F-BvFJKWvSNG19cqhj4hwDP9hbadIEBa1z7Qb-9166dlNRQXxsSEJ6uePuuMvvh9Cho5Qm0gPlDVhkMUeBzQWKW7HNQEOkFiLyc7IJr932u92gU_CcpmW3e1mSHL1pMChNSVbrxbr24eGbb5BhCbMCz2EW5OwzzHAGmXT95n6Cumu7I1ZbCCMhDXTLsuZ3W3xyTNMPpi3yS200dzmNpX8fdhktFtEmro_UYwVNqWQVLXzAIISv6zFwa7qGTkFtMLg6EzUa8ggVY5G_2MWvgyg22iJx0dL1DMtxwUdzgiOcDvpD9baO7hoXt2dNqyBZsCSjJLNcsECPS4gTmYZwi3JfUU3hxJRTqrQXaeaxWAhl2DwFITH3mIogy3CIKwJXORuokrwkahNhzlQsILzwJSQpjmS-pkILzQj4PM0jWUV2KeFQFgjk5l-ewgl2shFVCKIKjahCu4qOxkt6I_iN3yYfwLWN5xng7Ga9FZoxmwauzX02JFV0XN5YWJhr-vOWW3-avY_mOueNsHXZvtpG89TceN7Yu4MqWX-gdtGsHGaPaX8v19J3E3PjAA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+unconstrained+binary+quadratic+programming+problem%3A+a+survey&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Kochenberger%2C+Gary&rft.au=Hao%2C+Jin-Kao&rft.au=Glover%2C+Fred&rft.au=Lewis%2C+Mark&rft.date=2014-07-01&rft.pub=Springer+US&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=28&rft.issue=1&rft.spage=58&rft.epage=81&rft_id=info:doi/10.1007%2Fs10878-014-9734-0&rft.externalDocID=10_1007_s10878_014_9734_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon