On linearization techniques for budget-constrained binary quadratic programming problems

Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational perfor...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters Vol. 44; no. 6; pp. 702 - 705
Main Authors: Yang, Mei-Jia, Xia, Yong, Zou, Hui-Min
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2016
Subjects:
Binary quadratic programming
Budget constraint
Linear programming relaxation
Linearization
Binary quadratic programming
Linear programming relaxation
Budget constraint
Linearization
ISSN:0167-6377, 1872-7468
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational performance for globally solving (BBQP).
AbstractList Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the recent two linearizations for (BBQP), it not only provides a tighter relaxation at the root node, but also has a much better computational performance for globally solving (BBQP).
Author Yang, Mei-Jia
Zou, Hui-Min
Xia, Yong
Author_xml – sequence: 1
  givenname: Mei-Jia
  surname: Yang
  fullname: Yang, Mei-Jia
  email: 15201644541@163.com
  organization: State Key Laboratory of Software Development Environment, LMIB of the Ministry of Education, School of Mathematics and System Sciences, Beihang University, Beijing, 100191, PR China
– sequence: 2
  givenname: Yong
  surname: Xia
  fullname: Xia, Yong
  email: dearyxia@gmail.com
  organization: State Key Laboratory of Software Development Environment, LMIB of the Ministry of Education, School of Mathematics and System Sciences, Beihang University, Beijing, 100191, PR China
– sequence: 3
  givenname: Hui-Min
  surname: Zou
  fullname: Zou, Hui-Min
  email: 13161563408@163.com
  organization: Beijing Polytechnic, Beijing, 100176, PR China
BookMark eNp9kMtOwzAQRS1UJNrCB7DLDyTYcYgdsUIVL6lSN12ws_yYFFeJ3doJEnw9DmXFoqu5mpkzmnsXaOa8A4RuCS4IJvXdvvChK8okC9wUGJcXaE44K3NW1XyG5mnA8poydoUWMe4xxowTPkfvG5d11oEM9lsO1rtsAP3h7HGEmLU-ZGo0Oxhy7V0cgkybJlPWyfCVHUdpQmJ0dgh-F2TfW7ebtOqgj9fospVdhJu_ukTb56ft6jVfb17eVo_rXNOSD7nhsm5lWcpWc0JUzQw1ppZMVakN2ihdSXoPlQQomaoNkZyrqtG0oUQDpUtETmd18DEGaMUh2D69JwgWUzJiL1IyYkpG4EakZBLD_jHaDr_mJ4fdWfLhREJy9GkhiKgtOA3GBtCDMN6eoX8AE5yEQA
CitedBy_id crossref_primary_10_1287_ijoc_2018_0840
Cites_doi 10.1080/10556780500273077
10.1016/j.orl.2004.03.005
10.1287/mnsc.32.10.1274
10.1016/0377-2217(90)90297-O
10.1287/opre.21.1.156
10.1007/s004530010050
10.1007/s11590-006-0019-0
10.1016/j.cor.2004.09.033
10.1287/opre.15.6.1171
10.1287/mnsc.22.4.455
10.1145/103147.103156
10.1287/opre.38.2.217
10.1287/opre.22.1.180
10.1023/A:1009877331765
10.1007/s11590-010-0249-z
ContentType Journal Article
Copyright 2016 Elsevier B.V.
Copyright_xml – notice: 2016 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.orl.2016.09.002
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 1872-7468
EndPage 705
ExternalDocumentID 10_1016_j_orl_2016_09_002
S0167637716300864
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1OL
1RT
1~.
1~5
29N
4.4
457
4G.
4R4
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABAOU
ABFNM
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADGUI
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSW
SSZ
T5K
TN5
WH7
WUQ
XPP
XSW
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c328t-d8a6fa22afc811b67d3dd6a7b46faecdbc4a35e4aee27b6d1a88b49c3931ce33
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000389167500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0167-6377
IngestDate Tue Nov 18 20:04:02 EST 2025
Sat Nov 29 02:30:17 EST 2025
Fri Feb 23 02:30:14 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Binary quadratic programming
Linear programming relaxation
Budget constraint
Linearization
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c328t-d8a6fa22afc811b67d3dd6a7b46faecdbc4a35e4aee27b6d1a88b49c3931ce33
PageCount 4
ParticipantIDs crossref_primary_10_1016_j_orl_2016_09_002
crossref_citationtrail_10_1016_j_orl_2016_09_002
elsevier_sciencedirect_doi_10_1016_j_orl_2016_09_002
PublicationCentury 2000
PublicationDate 2016-11-01
PublicationDateYYYYMMDD 2016-11-01
PublicationDate_xml – month: 11
  year: 2016
  text: 2016-11-01
  day: 01
PublicationDecade 2010
PublicationTitle Operations research letters
PublicationYear 2016
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Adams, Sherali (br000005) 1986; 32
Zangwill (br000090) 1965; 5
Sherali, Smith (br000075) 2007; 1
Adams, Sherali (br000010) 1990; 38
F. Glover, E. Woolsey, Converting the 0-1 polynomial programming problem to a 0-1 linear program. IRMIS Working paper, 9304, School of Business, Indiana University, Bollomingto, Indiana, 1974.
Feige, Kortsarz, Peleg (br000025) 2001; 29
Chaovalitwongse, Pardalos, Prokoyev (br000015) 2004; 32
He, Chen, Chaovalitwongse, Liu (br000050) 2012; 6
Horst, Pardalos, Thoai (br000055) 2000
Iasemidis, Pardalos, Sackellares, Shiau (br000060) 2001; 5
Xia, Yuan (br000085) 2006; 21
Erkut (br000020) 1990; 46
Glover (br000030) 1975; 22
Watters (br000080) 1967; 15
P. Hansen, I. Moon, Dispersing facilities on a network, in: Presentation at the TIMS/ORSA Joint National Meeting, Washington, DC, 1988.
Glover, Woolsey (br000035) 1973; 21
Pardalos (br000065) 1991; 17
Pisinger (br000070) 2006; 33
10.1016/j.orl.2016.09.002_br000040
10.1016/j.orl.2016.09.002_br000045
Watters (10.1016/j.orl.2016.09.002_br000080) 1967; 15
Sherali (10.1016/j.orl.2016.09.002_br000075) 2007; 1
Feige (10.1016/j.orl.2016.09.002_br000025) 2001; 29
Xia (10.1016/j.orl.2016.09.002_br000085) 2006; 21
Iasemidis (10.1016/j.orl.2016.09.002_br000060) 2001; 5
Adams (10.1016/j.orl.2016.09.002_br000005) 1986; 32
Pardalos (10.1016/j.orl.2016.09.002_br000065) 1991; 17
Erkut (10.1016/j.orl.2016.09.002_br000020) 1990; 46
Pisinger (10.1016/j.orl.2016.09.002_br000070) 2006; 33
Glover (10.1016/j.orl.2016.09.002_br000030) 1975; 22
Horst (10.1016/j.orl.2016.09.002_br000055) 2000
Glover (10.1016/j.orl.2016.09.002_br000035) 1973; 21
Chaovalitwongse (10.1016/j.orl.2016.09.002_br000015) 2004; 32
He (10.1016/j.orl.2016.09.002_br000050) 2012; 6
Zangwill (10.1016/j.orl.2016.09.002_br000090) 1965; 5
Adams (10.1016/j.orl.2016.09.002_br000010) 1990; 38
References_xml – volume: 29
  start-page: 410
  year: 2001
  end-page: 421
  ident: br000025
  article-title: The dense k-subgraph problem1
  publication-title: Algorithmica
– volume: 15
  start-page: 1171
  year: 1967
  end-page: 1174
  ident: br000080
  article-title: Reduction of integer polynomial programming problems to zero–one linear programming problems
  publication-title: Oper. Res.
– volume: 38
  start-page: 217
  year: 1990
  end-page: 226
  ident: br000010
  article-title: Linearization strategies for a class of zero–one mixed integer programming problems
  publication-title: Oper. Res.
– volume: 22
  start-page: 455
  year: 1975
  end-page: 460
  ident: br000030
  article-title: Improved linear integer programming formulations of nonlinear integer programs
  publication-title: Manage. Sci.
– volume: 33
  start-page: 1380
  year: 2006
  end-page: 1398
  ident: br000070
  article-title: Upper bounds and exact algorithms for p-dispersion problems
  publication-title: Comput. Oper. Res.
– volume: 1
  start-page: 33
  year: 2007
  end-page: 47
  ident: br000075
  article-title: An improved linearization strategy for zero–one quadratic programming problems
  publication-title: Optim. Lett.
– volume: 21
  start-page: 156
  year: 1973
  end-page: 161
  ident: br000035
  article-title: Further reduction of zero–one polynomial programming problems to zero–one linear programming problems
  publication-title: Oper. Res.
– year: 2000
  ident: br000055
  article-title: Introduction to Global Optimization
– reference: F. Glover, E. Woolsey, Converting the 0-1 polynomial programming problem to a 0-1 linear program. IRMIS Working paper, 9304, School of Business, Indiana University, Bollomingto, Indiana, 1974.
– volume: 21
  start-page: 805
  year: 2006
  end-page: 818
  ident: br000085
  article-title: A new lineariztion method for quadratic assignment problems
  publication-title: Optim. Methods Softw.
– volume: 46
  start-page: 48
  year: 1990
  end-page: 60
  ident: br000020
  article-title: The discrete p-dispersion problem
  publication-title: European J. Oper. Res.
– reference: P. Hansen, I. Moon, Dispersing facilities on a network, in: Presentation at the TIMS/ORSA Joint National Meeting, Washington, DC, 1988.
– volume: 6
  start-page: 31
  year: 2012
  end-page: 41
  ident: br000050
  article-title: An improved linearization technique for a class of quadratic 0-1 programming problems
  publication-title: Optim. Lett.
– volume: 32
  start-page: 517
  year: 2004
  end-page: 522
  ident: br000015
  article-title: A new linearization technique for multi-quadratic 0–1 programming problems
  publication-title: Oper. Res. Lett.
– volume: 5
  start-page: 30
  year: 1965
  end-page: 36
  ident: br000090
  article-title: Media selection by decision programming
  publication-title: J. Advert. Res.
– volume: 17
  start-page: 74
  year: 1991
  end-page: 87
  ident: br000065
  article-title: Construction of test problems in quadratic bivalent programming
  publication-title: ACM Trans. Math. Software
– volume: 32
  start-page: 1274
  year: 1986
  end-page: 1290
  ident: br000005
  article-title: A tight linearization and an algorithm for zero–one quadratic programming problems
  publication-title: Manage. Sci.
– volume: 5
  start-page: 9
  year: 2001
  end-page: 26
  ident: br000060
  article-title: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
  publication-title: J. Comb. Optim.
– volume: 21
  start-page: 805
  issue: 5
  year: 2006
  ident: 10.1016/j.orl.2016.09.002_br000085
  article-title: A new lineariztion method for quadratic assignment problems
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780500273077
– volume: 32
  start-page: 517
  year: 2004
  ident: 10.1016/j.orl.2016.09.002_br000015
  article-title: A new linearization technique for multi-quadratic 0–1 programming problems
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.03.005
– volume: 32
  start-page: 1274
  year: 1986
  ident: 10.1016/j.orl.2016.09.002_br000005
  article-title: A tight linearization and an algorithm for zero–one quadratic programming problems
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.32.10.1274
– volume: 46
  start-page: 48
  year: 1990
  ident: 10.1016/j.orl.2016.09.002_br000020
  article-title: The discrete p-dispersion problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(90)90297-O
– volume: 21
  start-page: 156
  year: 1973
  ident: 10.1016/j.orl.2016.09.002_br000035
  article-title: Further reduction of zero–one polynomial programming problems to zero–one linear programming problems
  publication-title: Oper. Res.
  doi: 10.1287/opre.21.1.156
– volume: 29
  start-page: 410
  year: 2001
  ident: 10.1016/j.orl.2016.09.002_br000025
  article-title: The dense k-subgraph problem1
  publication-title: Algorithmica
  doi: 10.1007/s004530010050
– volume: 1
  start-page: 33
  year: 2007
  ident: 10.1016/j.orl.2016.09.002_br000075
  article-title: An improved linearization strategy for zero–one quadratic programming problems
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-006-0019-0
– volume: 33
  start-page: 1380
  year: 2006
  ident: 10.1016/j.orl.2016.09.002_br000070
  article-title: Upper bounds and exact algorithms for p-dispersion problems
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2004.09.033
– year: 2000
  ident: 10.1016/j.orl.2016.09.002_br000055
– volume: 15
  start-page: 1171
  year: 1967
  ident: 10.1016/j.orl.2016.09.002_br000080
  article-title: Reduction of integer polynomial programming problems to zero–one linear programming problems
  publication-title: Oper. Res.
  doi: 10.1287/opre.15.6.1171
– volume: 22
  start-page: 455
  year: 1975
  ident: 10.1016/j.orl.2016.09.002_br000030
  article-title: Improved linear integer programming formulations of nonlinear integer programs
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.22.4.455
– volume: 17
  start-page: 74
  year: 1991
  ident: 10.1016/j.orl.2016.09.002_br000065
  article-title: Construction of test problems in quadratic bivalent programming
  publication-title: ACM Trans. Math. Software
  doi: 10.1145/103147.103156
– volume: 38
  start-page: 217
  year: 1990
  ident: 10.1016/j.orl.2016.09.002_br000010
  article-title: Linearization strategies for a class of zero–one mixed integer programming problems
  publication-title: Oper. Res.
  doi: 10.1287/opre.38.2.217
– ident: 10.1016/j.orl.2016.09.002_br000040
  doi: 10.1287/opre.22.1.180
– ident: 10.1016/j.orl.2016.09.002_br000045
– volume: 5
  start-page: 9
  issue: 1
  year: 2001
  ident: 10.1016/j.orl.2016.09.002_br000060
  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: 5
  start-page: 30
  year: 1965
  ident: 10.1016/j.orl.2016.09.002_br000090
  article-title: Media selection by decision programming
  publication-title: J. Advert. Res.
– volume: 6
  start-page: 31
  year: 2012
  ident: 10.1016/j.orl.2016.09.002_br000050
  article-title: An improved linearization technique for a class of quadratic 0-1 programming problems
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-010-0249-z
SSID ssj0007818
Score 2.1121933
Snippet Glover’s linearization technique is revisited for solving the binary quadratic programming problem with a budget constraint (BBQP). When compared with the...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 702
SubjectTerms Binary quadratic programming
Budget constraint
Linear programming relaxation
Linearization
Title On linearization techniques for budget-constrained binary quadratic programming problems
URI https://dx.doi.org/10.1016/j.orl.2016.09.002
Volume 44
WOSCitedRecordID wos000389167500002&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7468
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007818
  issn: 0167-6377
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKxwM8IDZAjC_5gQegCooTx3YeJzQEk7Yi0YfsKXJsBzqVtKTNNP57zrGTpRQQICFVVmXF-fD9cj5f7n6H0POkNJEuCQsoKaAxjAWFVkkgCSklB6mHYdEWm-BnZyLL0g-j0bcuF-ZywatKXF2lq_8qaugDYdvU2b8Qd39S6ID_IHRoQezQ_pHgp9XEmo6wB3YZlpOepnXtYjMb_clsAmUNQ1sfwpqgLin3ayN13TK4-qitLy5VvS05sx6asdOVqX0MnWcL-jxZtIlBvYl-7h3Rp2YenMx75Z-54NzzpV8xrc962bQLYDMPTj0PuHdDgHDJlhtiNz_GuStBDbPYF2oxTsUKDjY9dcV0Oh3sOCA91oYKlYfRYG3mbYr2rtp3HoiL18vafk0irKWu7UZusWl_tLdk74hYrjHB6A20F_EkFWO0d_T-ODvpl3EuWudw_wjdJ_E2OPCHC_3cqBkYKrO76I7fYeAjh4x9NDLVAbo94J08QPteo6_xC087_vIeyqYV3gIOvgYOBuDgXeBgBxzcAwcPgIM74NxHs7fHszfvAl93I1BxJDaBFpKVMopkqQSBV5jrWGsmeUGh2yhdKCrjxFBpTMQLpokUoqCpitOYKBPHD9C4WlbmIcJFksQmjNNCsJJKUsDemkXUyBJ-oVDiEIXdvOXKc9LbJ1jkXfDhRQ5TndupzsM0h6k-RK_6IStHyPK7g2knjNxblM5SzAE5vx726N-GPUa3rt-MJ2i8qRvzFN1Ul5v5un7m8fUd0HqelA
linkProvider Elsevier
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=On+linearization+techniques+for+budget-constrained+binary+quadratic+programming+problems&rft.jtitle=Operations+research+letters&rft.au=Yang%2C+Mei-Jia&rft.au=Xia%2C+Yong&rft.au=Zou%2C+Hui-Min&rft.date=2016-11-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.eissn=1872-7468&rft.volume=44&rft.issue=6&rft.spage=702&rft.epage=705&rft_id=info:doi/10.1016%2Fj.orl.2016.09.002&rft.externalDocID=S0167637716300864
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon