Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming

We propose methods for improving the relaxations obtained by the normalized multiparametric disaggregation technique (NMDT). These relaxations constitute a key component for some methods for solving nonconvex mixed-integer quadratically constrained quadratic programming (MIQCQP) problems. It is show...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 73; číslo 4; s. 701 - 722
Hlavní autori: Andrade, Tiago, Oliveira, Fabricio, Hamacher, Silvio, Eberhard, Andrew
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 15.04.2019
Springer
Springer Nature B.V
Predmet:
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We propose methods for improving the relaxations obtained by the normalized multiparametric disaggregation technique (NMDT). These relaxations constitute a key component for some methods for solving nonconvex mixed-integer quadratically constrained quadratic programming (MIQCQP) problems. It is shown that these relaxations can be more efficiently formulated by significantly reducing the number of auxiliary variables (in particular, binary variables) and constraints. Moreover, a novel algorithm for solving MIQCQP problems is proposed. It can be applied using either its original NMDT or the proposed reformulation. Computational experiments are performed using both benchmark instances from the literature and randomly generated instances. The numerical results suggest that the proposed techniques can improve the quality of the relaxations.
AbstractList We propose methods for improving the relaxations obtained by the normalized multiparametric disaggregation technique (NMDT). These relaxations constitute a key component for some methods for solving nonconvex mixed-integer quadratically constrained quadratic programming (MIQCQP) problems. It is shown that these relaxations can be more efficiently formulated by significantly reducing the number of auxiliary variables (in particular, binary variables) and constraints. Moreover, a novel algorithm for solving MIQCQP problems is proposed. It can be applied using either its original NMDT or the proposed reformulation. Computational experiments are performed using both benchmark instances from the literature and randomly generated instances. The numerical results suggest that the proposed techniques can improve the quality of the relaxations.
Audience Academic
Author Eberhard, Andrew
Oliveira, Fabricio
Andrade, Tiago
Hamacher, Silvio
Author_xml – sequence: 1
  givenname: Tiago
  surname: Andrade
  fullname: Andrade, Tiago
  organization: Pontifícia Universidade Católica do Rio de Janeiro (Puc-Rio) R. Marquês de São Vicente
– sequence: 2
  givenname: Fabricio
  orcidid: 0000-0003-0300-9337
  surname: Oliveira
  fullname: Oliveira, Fabricio
  organization: Systems Analysis Laboratory, Department of Mathematics and Systems Analysis, School of Science, Aalto University
– sequence: 3
  givenname: Silvio
  surname: Hamacher
  fullname: Hamacher, Silvio
  organization: Pontifícia Universidade Católica do Rio de Janeiro (Puc-Rio) R. Marquês de São Vicente
– sequence: 4
  givenname: Andrew
  orcidid: 0000-0003-2977-3456
  surname: Eberhard
  fullname: Eberhard, Andrew
  email: andy.eberhard@rmit.edu.au
  organization: RMIT University
BookMark eNp9kUFr3DAQhUVJoZu0P6A3Qc9OR7ZkWccQ0qYQyKU9C-1I9irY8kbSQttf39m6UCg0CCEY3jczeu-SXaQ1BcbeC7gWAPpjETCYoQFBV7dDY16xnVC6a1oj-gu2A9OqRgGIN-yylCcAMINqdyzepYNLGNPE6yHwtObFzfFn8Hw5zTUeXXZLqDki97G4acphcjWuideAhxSfT4GPa-ZL_B58E1MNU8j8-eR8JhnyY14n6rBQ_7fs9ejmEt79ea_Yt093X2_vm4fHz19ubx4a7MxQGw2yc0pqQCG0Qo3eGdW3o1D7fedBKumxd05D36EZjZBogkHo9l71UqPprtiHrS_NpvVKtU_rKScaaVtyRANIoUl1vakmNwcb07jW7JCOD0tE8naMVL_RYpCt1FIQoDcA81pKDqPFWH9bQWCcrQB7DsJuQVgKwp6DsOeFxD_kMcfF5R8vMu3GFNIm8vTvJ_4P_QJayp52
CitedBy_id crossref_primary_10_1007_s10898_025_01491_8
crossref_primary_10_1016_j_compchemeng_2020_107205
crossref_primary_10_1016_j_compchemeng_2021_107459
crossref_primary_10_1016_j_compchemeng_2020_106883
crossref_primary_10_1007_s10898_022_01138_y
crossref_primary_10_1007_s10589_022_00440_5
crossref_primary_10_1016_j_compchemeng_2023_108229
crossref_primary_10_1109_TSTE_2024_3422236
crossref_primary_10_1111_itor_70001
crossref_primary_10_1109_TCYB_2021_3088221
crossref_primary_10_1016_j_compchemeng_2023_108539
crossref_primary_10_1002_aic_17404
crossref_primary_10_1007_s11081_021_09603_5
Cites_doi 10.1016/S0377-2217(96)00310-4
10.1016/j.compchemeng.2014.03.025
10.1023/A:1026583532263
10.1007/BF01580665
10.1016/j.compchemeng.2005.11.005
10.1007/s10898-011-9809-8
10.1021/ie8016048
10.1016/S0098-1354(00)00579-2
10.1007/s10898-015-0342-z
10.1080/10556780902883184
10.1007/s10107-003-0467-6
10.1007/s101070100263
10.1007/BF00138693
10.1109/TIT.1979.1055985
10.1021/ie901632w
10.1007/s10898-004-1947-9
10.1016/S0167-5060(08)70342-X
10.1007/BF00120662
10.1023/A:1020383700229
10.1007/s13675-016-0079-6
10.1007/s10107-005-0582-7
10.1109/MSP.2010.936019
10.1002/aic.11425
10.1287/moor.16.2.390
10.1021/acs.iecr.5b01132
10.1147/rd.471.0057
10.1023/A:1013819515732
10.1007/s10898-012-0022-1
10.1007/BF01099647
10.1016/j.ejor.2011.04.026
10.1007/s10898-008-9372-0
10.1137/1035044
10.1145/227683.227684
10.1287/opre.21.1.221
10.1023/A:1026596100403
10.1016/j.compchemeng.2012.02.018
10.1287/moor.8.2.273
10.1007/978-0-387-74759-0_375
10.1007/s10107-018-1253-9
ContentType Journal Article
Copyright The Author(s) 2018
COPYRIGHT 2019 Springer
Journal of Global Optimization is a copyright of Springer, (2018). All Rights Reserved. © 2018. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2018
– notice: COPYRIGHT 2019 Springer
– notice: Journal of Global Optimization is a copyright of Springer, (2018). All Rights Reserved. © 2018. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
L7M
L~C
L~D
M0C
M0N
M2O
M2P
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10898-018-0728-9
DatabaseName Springer Nature OA Free Journals
CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Research Library (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
Research Library Prep (ProQuest)
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Research Library
Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Research Library
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList

ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Sciences (General)
Computer Science
EISSN 1573-2916
EndPage 722
ExternalDocumentID A718424741
10_1007_s10898_018_0728_9
GrantInformation_xml – fundername: Brazilian National Council for Scientific and Technological Development
– fundername: Australian Research Council
  grantid: DP140100985
  funderid: http://dx.doi.org/10.13039/501100000923
– fundername: Coordination for the Improvement of Higher Education Personnel
GroupedDBID -52
-57
-5G
-BR
-EM
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
203
29K
2J2
2JN
2JY
2KG
2LR
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
78A
7WY
88I
8AO
8FE
8FG
8FL
8G5
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABUWG
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
C6C
CCPQU
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GUQSH
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
L6V
LAK
LLZTM
M0C
M0N
M2O
M2P
M4Y
M7S
MA-
N9A
NB0
NPVJJ
NQJWS
NU0
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S27
S3B
SAP
SBE
SDD
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8T
Z8U
Z8W
Z92
ZMTXR
~EX
-Y2
1SB
2.D
28-
2P1
2VQ
5QI
AAPKM
AARHV
AAYTO
AAYXX
ABBRH
ABDBE
ABFSG
ABQSL
ABRTQ
ABULA
ACBXY
ACSTC
ADHKG
AEBTG
AEFIE
AEKMD
AEZWR
AFDZB
AFEXP
AFFHD
AFGCZ
AFHIU
AFOHR
AGGDS
AGQPQ
AHPBZ
AHWEU
AI.
AIXLP
AJBLW
AMVHM
ATHPR
AYFIA
BBWZM
CAG
CITATION
COF
H13
KOW
N2Q
NDZJH
O9-
OVD
PHGZM
PHGZT
PQGLB
R4E
RNI
RZC
RZE
RZK
S1Z
S26
S28
SCLPG
T16
TEORI
VH1
ZWQNP
ZY4
3V.
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c398t-7043a5470c1175c7cda9562f15bb3d0454dc6aa7063c9f914c9e9c03bd5647c93
IEDL.DBID RSV
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000462013800002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5001
IngestDate Tue Nov 04 22:32:18 EST 2025
Sat Nov 29 10:09:48 EST 2025
Sat Nov 29 01:59:34 EST 2025
Tue Nov 18 22:09:48 EST 2025
Fri Feb 21 02:42:28 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords McCormick envelopes
Convex relaxation
Nonconvex mixed-integer quadratically constrained quadratic programs
Normalized multiparametric disaggregation technique
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c398t-7043a5470c1175c7cda9562f15bb3d0454dc6aa7063c9f914c9e9c03bd5647c93
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-0300-9337
0000-0003-2977-3456
OpenAccessLink https://link.springer.com/10.1007/s10898-018-0728-9
PQID 2157700417
PQPubID 29930
PageCount 22
ParticipantIDs proquest_journals_2157700417
gale_infotracacademiconefile_A718424741
crossref_citationtrail_10_1007_s10898_018_0728_9
crossref_primary_10_1007_s10898_018_0728_9
springer_journals_10_1007_s10898_018_0728_9
PublicationCentury 2000
PublicationDate 20190415
PublicationDateYYYYMMDD 2019-04-15
PublicationDate_xml – month: 4
  year: 2019
  text: 20190415
  day: 15
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationSubtitle An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle Journal of global optimization
PublicationTitleAbbrev J Glob Optim
PublicationYear 2019
Publisher Springer US
Springer
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer
– name: Springer Nature B.V
References Linderoth (CR27) 2005; 103
Castro (CR12) 2015; 72
Andrade, Ribas, Oliveira (CR2) 2016; 55
Castro (CR13) 2016; 64
Wicaksono, Karimi (CR47) 2008; 54
Bagajewicz (CR5) 2000; 24
Fampa, Lee, Melo (CR16) 2017; 5
CR17
Rockafellar (CR36) 1993; 35
CR14
Sherali, Adams (CR38) 2013
CR34
Van Voorhis (CR45) 2002; 24
Bomze, Dür, De Klerk, Roos, Quist, Terlaky (CR11) 2000; 18
Lovász (CR29) 1979; 25
Bomze (CR10) 2012; 216
Anstreicher (CR4) 2009; 43
Lougee-Heimer (CR28) 2003; 47
Balas (CR6) 1979; 5
Jezowski (CR23) 2010; 49
Sahinidis (CR37) 1996; 8
Bao, Sahinidis, Tawarmalani (CR7) 2009; 24
Thakur (CR43) 1991; 16
Nowak (CR33) 2000; 18
Teles, Castro, Matos (CR41) 2012; 40
Al-Khayyal, Falk (CR1) 1983; 8
CR8
Dolan, Moré (CR15) 2002; 91
Jeroslow (CR22) 1973; 21
Luo, Ma, So, Ye, Zhang (CR30) 2010; 27
CR9
Sherali, Fraticelli (CR39) 2002; 22
CR46
Tawarmalani, Sahinidis (CR40) 2004; 99
Li, Chang (CR26) 1998; 107
McCormick (CR31) 1976; 10
Androulakis, Maranas, Floudas (CR3) 1995; 7
Gleixner, Berthold, Müller, Weltge (CR19) 2016; 67
Pardalos, Vavasis (CR35) 1991; 1
Garey, Johnson (CR18) 2002
Kolodziej, Castro, Grossmann (CR25) 2013; 57
Goemans, Williamson (CR20) 1995; 42
Gounaris, Misener, Floudas (CR21) 2009; 48
Tuy (CR44) 2005; 32
Misener, Floudas (CR32) 2009; 8
Karuppiah, Grossmann (CR24) 2006; 30
Teles, Castro, Matos (CR42) 2013; 55
PM Pardalos (728_CR35) 1991; 1
HD Sherali (728_CR38) 2013
HL Li (728_CR26) 1998; 107
DS Wicaksono (728_CR47) 2008; 54
IP Androulakis (728_CR3) 1995; 7
H Tuy (728_CR44) 2005; 32
S Kolodziej (728_CR25) 2013; 57
RT Rockafellar (728_CR36) 1993; 35
ZQ Luo (728_CR30) 2010; 27
728_CR34
PM Castro (728_CR13) 2016; 64
728_CR17
FA Al-Khayyal (728_CR1) 1983; 8
728_CR14
R Karuppiah (728_CR24) 2006; 30
R Jeroslow (728_CR22) 1973; 21
J Linderoth (728_CR27) 2005; 103
MR Garey (728_CR18) 2002
AM Gleixner (728_CR19) 2016; 67
J Jezowski (728_CR23) 2010; 49
JP Teles (728_CR42) 2013; 55
T Van Voorhis (728_CR45) 2002; 24
728_CR9
PM Castro (728_CR12) 2015; 72
HD Sherali (728_CR39) 2002; 22
R Misener (728_CR32) 2009; 8
NV Sahinidis (728_CR37) 1996; 8
MX Goemans (728_CR20) 1995; 42
KM Anstreicher (728_CR4) 2009; 43
M Fampa (728_CR16) 2017; 5
CE Gounaris (728_CR21) 2009; 48
E Balas (728_CR6) 1979; 5
728_CR8
X Bao (728_CR7) 2009; 24
IM Bomze (728_CR11) 2000; 18
728_CR46
M Tawarmalani (728_CR40) 2004; 99
LS Thakur (728_CR43) 1991; 16
R Lougee-Heimer (728_CR28) 2003; 47
ED Dolan (728_CR15) 2002; 91
JP Teles (728_CR41) 2012; 40
L Lovász (728_CR29) 1979; 25
GP McCormick (728_CR31) 1976; 10
T Andrade (728_CR2) 2016; 55
M Bagajewicz (728_CR5) 2000; 24
IM Bomze (728_CR10) 2012; 216
I Nowak (728_CR33) 2000; 18
References_xml – volume: 107
  start-page: 625
  issue: 3
  year: 1998
  end-page: 632
  ident: CR26
  article-title: An approximate approach of global optimization for polynomial programming problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(96)00310-4
– volume: 72
  start-page: 300
  year: 2015
  end-page: 311
  ident: CR12
  article-title: Tightening piecewise McCormick relaxations for bilinear problems
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2014.03.025
– volume: 18
  start-page: 301
  issue: 4
  year: 2000
  end-page: 320
  ident: CR11
  article-title: On copositive programming and standard quadratic optimization problems
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026583532263
– volume: 10
  start-page: 147
  issue: 1
  year: 1976
  end-page: 175
  ident: CR31
  article-title: Computability of global solutions to factorable nonconvex programs: part I convex underestimating problems
  publication-title: Math. Program.
  doi: 10.1007/BF01580665
– volume: 8
  start-page: 3
  issue: 1
  year: 2009
  end-page: 22
  ident: CR32
  article-title: Advances for the pooling problem: modeling, global optimization, and computational studies
  publication-title: Appl. Comput. Math.
– ident: CR14
– volume: 30
  start-page: 650
  issue: 4
  year: 2006
  end-page: 673
  ident: CR24
  article-title: Global optimization for the synthesis of integrated water systems in chemical processes
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2005.11.005
– volume: 55
  start-page: 227
  issue: 2
  year: 2013
  end-page: 251
  ident: CR42
  article-title: Multi-parametric disaggregation technique for global optimization of polynomial programming problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-011-9809-8
– year: 2002
  ident: CR18
  publication-title: Computers and Intractability: A Guide to the Theory of NP
– volume: 48
  start-page: 5742
  issue: 12
  year: 2009
  end-page: 5766
  ident: CR21
  article-title: Computational comparison of piecewise- linear relaxations for pooling problems
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/ie8016048
– volume: 24
  start-page: 2093
  issue: 9
  year: 2000
  end-page: 2113
  ident: CR5
  article-title: A review of recent design procedures for water networks in refineries and process plants
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/S0098-1354(00)00579-2
– volume: 64
  start-page: 765
  issue: 4
  year: 2016
  end-page: 784
  ident: CR13
  article-title: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0342-z
– volume: 24
  start-page: 485
  issue: 4–5
  year: 2009
  end-page: 504
  ident: CR7
  article-title: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780902883184
– volume: 99
  start-page: 563
  issue: 3
  year: 2004
  end-page: 591
  ident: CR40
  article-title: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0467-6
– ident: CR8
– volume: 91
  start-page: 201
  issue: 2
  year: 2002
  end-page: 213
  ident: CR15
  article-title: Benchmarking optimization software with performance profiles
  publication-title: Math. Program.
  doi: 10.1007/s101070100263
– volume: 8
  start-page: 201
  issue: 2
  year: 1996
  end-page: 205
  ident: CR37
  article-title: Baron: a general purpose global optimization software package
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00138693
– volume: 25
  start-page: 1
  issue: 1
  year: 1979
  end-page: 7
  ident: CR29
  article-title: On the shannon capacity of a graph
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1979.1055985
– volume: 49
  start-page: 4475
  issue: 10
  year: 2010
  end-page: 4516
  ident: CR23
  article-title: Review of water network design methods with literature annotations
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/ie901632w
– volume: 32
  start-page: 349
  issue: 3
  year: 2005
  end-page: 365
  ident: CR44
  article-title: On solving nonconvex optimization problems by reducing the duality gap
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-004-1947-9
– volume: 5
  start-page: 3
  year: 1979
  end-page: 51
  ident: CR6
  article-title: Disjunctive programming
  publication-title: Ann. Discrete Math.
  doi: 10.1016/S0167-5060(08)70342-X
– year: 2013
  ident: CR38
  publication-title: A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems
– volume: 1
  start-page: 15
  issue: 1
  year: 1991
  end-page: 22
  ident: CR35
  article-title: Quadratic programming with one negative eigenvalue is NP-hard
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00120662
– volume: 24
  start-page: 349
  issue: 3
  year: 2002
  end-page: 370
  ident: CR45
  article-title: A global optimization algorithm using lagrangian underestimates and the interval newton method
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1020383700229
– ident: CR46
– volume: 5
  start-page: 309
  issue: 3
  year: 2017
  end-page: 337
  ident: CR16
  article-title: On global optimization with indefinite quadratics
  publication-title: EURO J. Comput. Optim.
  doi: 10.1007/s13675-016-0079-6
– volume: 103
  start-page: 251
  issue: 2
  year: 2005
  end-page: 282
  ident: CR27
  article-title: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
  publication-title: Math. Program.
  doi: 10.1007/s10107-005-0582-7
– volume: 27
  start-page: 20
  issue: 3
  year: 2010
  end-page: 34
  ident: CR30
  article-title: Semidefinite relaxation of quadratic optimization problems
  publication-title: IEEE Signal Proc. Mag.
  doi: 10.1109/MSP.2010.936019
– volume: 54
  start-page: 991
  issue: 4
  year: 2008
  end-page: 1008
  ident: CR47
  article-title: Piecewise MILP under-and overestimators for global optimization of bilinear programs
  publication-title: AIChE J.
  doi: 10.1002/aic.11425
– volume: 16
  start-page: 390
  issue: 2
  year: 1991
  end-page: 407
  ident: CR43
  article-title: Domain contraction in nonlinear programming: minimizing a quadratic concave objective over a polyhedron
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.16.2.390
– volume: 55
  start-page: 144
  issue: 1
  year: 2016
  end-page: 155
  ident: CR2
  article-title: A strategy based on convex relaxation for solving the oil refinery operations planning problem
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/acs.iecr.5b01132
– volume: 47
  start-page: 57
  issue: 1
  year: 2003
  end-page: 66
  ident: CR28
  article-title: The common optimization interface for operations research
  publication-title: IBM J. Res. Dev.
  doi: 10.1147/rd.471.0057
– volume: 22
  start-page: 233
  issue: 1
  year: 2002
  end-page: 261
  ident: CR39
  article-title: Enhancing rlt relaxations via a new class of semidefinite cuts
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1013819515732
– ident: CR17
– volume: 57
  start-page: 1039
  issue: 4
  year: 2013
  end-page: 1063
  ident: CR25
  article-title: Global optimization of bilinear programs with a multiparametric disaggregation technique
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-012-0022-1
– volume: 7
  start-page: 337
  issue: 4
  year: 1995
  end-page: 363
  ident: CR3
  article-title: BB: a global optimization method for general constrained nonconvex problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF01099647
– ident: CR9
– volume: 216
  start-page: 509
  issue: 3
  year: 2012
  end-page: 520
  ident: CR10
  article-title: Copositive optimization-Recent developments and applications
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.04.026
– ident: CR34
– volume: 43
  start-page: 471
  issue: 2
  year: 2009
  end-page: 484
  ident: CR4
  article-title: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-008-9372-0
– volume: 67
  start-page: 1
  issue: 4
  year: 2016
  end-page: 27
  ident: CR19
  article-title: Three enhancements for optimization-based bound tightening
  publication-title: J. Glob. Optim.
– volume: 35
  start-page: 183
  issue: 2
  year: 1993
  end-page: 238
  ident: CR36
  article-title: Lagrange multipliers and optimality
  publication-title: SIAM Rev.
  doi: 10.1137/1035044
– volume: 42
  start-page: 1115
  issue: 6
  year: 1995
  end-page: 1145
  ident: CR20
  article-title: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
  publication-title: J. ACM (JACM)
  doi: 10.1145/227683.227684
– volume: 21
  start-page: 221
  issue: 1
  year: 1973
  end-page: 224
  ident: CR22
  article-title: There cannot be any algorithm for integer programming with quadratic constraints
  publication-title: Oper. Res.
  doi: 10.1287/opre.21.1.221
– volume: 18
  start-page: 337
  issue: 4
  year: 2000
  end-page: 356
  ident: CR33
  article-title: Dual bounds and optimality cuts for all-quadratic programs with convex constraints
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026596100403
– volume: 40
  start-page: 132
  year: 2012
  end-page: 147
  ident: CR41
  article-title: Global optimization of water networks design using multiparametric disaggregation
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2012.02.018
– volume: 8
  start-page: 273
  issue: 2
  year: 1983
  end-page: 286
  ident: CR1
  article-title: Jointly constrained biconvex programming
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.2.273
– ident: 728_CR8
– volume: 40
  start-page: 132
  year: 2012
  ident: 728_CR41
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2012.02.018
– volume: 5
  start-page: 3
  year: 1979
  ident: 728_CR6
  publication-title: Ann. Discrete Math.
  doi: 10.1016/S0167-5060(08)70342-X
– volume: 42
  start-page: 1115
  issue: 6
  year: 1995
  ident: 728_CR20
  publication-title: J. ACM (JACM)
  doi: 10.1145/227683.227684
– volume: 54
  start-page: 991
  issue: 4
  year: 2008
  ident: 728_CR47
  publication-title: AIChE J.
  doi: 10.1002/aic.11425
– volume: 21
  start-page: 221
  issue: 1
  year: 1973
  ident: 728_CR22
  publication-title: Oper. Res.
  doi: 10.1287/opre.21.1.221
– volume: 47
  start-page: 57
  issue: 1
  year: 2003
  ident: 728_CR28
  publication-title: IBM J. Res. Dev.
  doi: 10.1147/rd.471.0057
– volume-title: A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems
  year: 2013
  ident: 728_CR38
– volume: 16
  start-page: 390
  issue: 2
  year: 1991
  ident: 728_CR43
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.16.2.390
– volume: 55
  start-page: 144
  issue: 1
  year: 2016
  ident: 728_CR2
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/acs.iecr.5b01132
– volume: 107
  start-page: 625
  issue: 3
  year: 1998
  ident: 728_CR26
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(96)00310-4
– volume: 49
  start-page: 4475
  issue: 10
  year: 2010
  ident: 728_CR23
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/ie901632w
– volume: 216
  start-page: 509
  issue: 3
  year: 2012
  ident: 728_CR10
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.04.026
– volume: 5
  start-page: 309
  issue: 3
  year: 2017
  ident: 728_CR16
  publication-title: EURO J. Comput. Optim.
  doi: 10.1007/s13675-016-0079-6
– volume: 32
  start-page: 349
  issue: 3
  year: 2005
  ident: 728_CR44
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-004-1947-9
– volume: 67
  start-page: 1
  issue: 4
  year: 2016
  ident: 728_CR19
  publication-title: J. Glob. Optim.
– volume: 24
  start-page: 485
  issue: 4–5
  year: 2009
  ident: 728_CR7
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556780902883184
– ident: 728_CR14
– volume: 99
  start-page: 563
  issue: 3
  year: 2004
  ident: 728_CR40
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0467-6
– volume: 8
  start-page: 3
  issue: 1
  year: 2009
  ident: 728_CR32
  publication-title: Appl. Comput. Math.
– volume-title: Computers and Intractability: A Guide to the Theory of NP
  year: 2002
  ident: 728_CR18
– volume: 10
  start-page: 147
  issue: 1
  year: 1976
  ident: 728_CR31
  publication-title: Math. Program.
  doi: 10.1007/BF01580665
– volume: 48
  start-page: 5742
  issue: 12
  year: 2009
  ident: 728_CR21
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/ie8016048
– volume: 43
  start-page: 471
  issue: 2
  year: 2009
  ident: 728_CR4
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-008-9372-0
– volume: 1
  start-page: 15
  issue: 1
  year: 1991
  ident: 728_CR35
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00120662
– volume: 24
  start-page: 349
  issue: 3
  year: 2002
  ident: 728_CR45
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1020383700229
– volume: 103
  start-page: 251
  issue: 2
  year: 2005
  ident: 728_CR27
  publication-title: Math. Program.
  doi: 10.1007/s10107-005-0582-7
– volume: 8
  start-page: 201
  issue: 2
  year: 1996
  ident: 728_CR37
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF00138693
– volume: 91
  start-page: 201
  issue: 2
  year: 2002
  ident: 728_CR15
  publication-title: Math. Program.
  doi: 10.1007/s101070100263
– ident: 728_CR46
  doi: 10.1007/978-0-387-74759-0_375
– ident: 728_CR9
  doi: 10.1007/s10107-018-1253-9
– volume: 30
  start-page: 650
  issue: 4
  year: 2006
  ident: 728_CR24
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2005.11.005
– ident: 728_CR17
– volume: 57
  start-page: 1039
  issue: 4
  year: 2013
  ident: 728_CR25
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-012-0022-1
– volume: 22
  start-page: 233
  issue: 1
  year: 2002
  ident: 728_CR39
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1013819515732
– volume: 24
  start-page: 2093
  issue: 9
  year: 2000
  ident: 728_CR5
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/S0098-1354(00)00579-2
– volume: 25
  start-page: 1
  issue: 1
  year: 1979
  ident: 728_CR29
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.1979.1055985
– volume: 18
  start-page: 337
  issue: 4
  year: 2000
  ident: 728_CR33
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026596100403
– volume: 64
  start-page: 765
  issue: 4
  year: 2016
  ident: 728_CR13
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0342-z
– volume: 35
  start-page: 183
  issue: 2
  year: 1993
  ident: 728_CR36
  publication-title: SIAM Rev.
  doi: 10.1137/1035044
– volume: 27
  start-page: 20
  issue: 3
  year: 2010
  ident: 728_CR30
  publication-title: IEEE Signal Proc. Mag.
  doi: 10.1109/MSP.2010.936019
– ident: 728_CR34
– volume: 55
  start-page: 227
  issue: 2
  year: 2013
  ident: 728_CR42
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-011-9809-8
– volume: 7
  start-page: 337
  issue: 4
  year: 1995
  ident: 728_CR3
  publication-title: J. Glob. Optim.
  doi: 10.1007/BF01099647
– volume: 8
  start-page: 273
  issue: 2
  year: 1983
  ident: 728_CR1
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.2.273
– volume: 18
  start-page: 301
  issue: 4
  year: 2000
  ident: 728_CR11
  publication-title: J. Glob. Optim.
  doi: 10.1023/A:1026583532263
– volume: 72
  start-page: 300
  year: 2015
  ident: 728_CR12
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/j.compchemeng.2014.03.025
SSID ssj0009852
Score 2.3268075
Snippet We propose methods for improving the relaxations obtained by the normalized multiparametric disaggregation technique (NMDT). These relaxations constitute a key...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 701
SubjectTerms Algorithms
Computer Science
Mathematics
Mathematics and Statistics
Methods
Operations Research/Decision Theory
Optimization
Quadratic programming
Real Functions
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB6Vx4Ee2vKougUqHypBQRZ5OHF8QhQt4lCtEALEzXLs7DYSBHazixC_npmswwJVuXDIKckk0jczHntmvgH4mUlpEidDnhYy4kLaiOehyDmRvyH8_X7adMhd_JG9XnZ5qU78gVvtyypbn9g4andj6Yx8D5cmSVTsody_HXKaGkXZVT9CYw4WiKkM9Xzhd7d3cjqj3c2amTuBihKeoEdu85rT5rmM2stCvGSEVv9iZXrtn_9JlDbrz9Hn9_75F_jkI092MFWVZfhQVCvw8Rkf4Qose0uv2bano_61CmW3-kukHNWAYbDIKgpyr8qHwrFpMaKh8i7i-WeurM0A9--DBm32RA_LMDBm1-V94XjDTlGM2HBiHOmeZb5A7Brlr8H5Uffs8Jj7AQ3cxiobcxmI2CRCBpYIP620zuB2K-qHSZ7Hjsj9nE2NkRgGWdVXobCqUDaIc5ekqBYq_grz1U1VfAPmpHOpyVEWxgvOxSYTUZDLBOMro4SKOxC04Gjr2ctpiMaVnvEuE54a8dSEp1Yd2Hl65XZK3fHWw1uEuCazRrnW-O4E_DsiyNIHuIYLVF8RdmCjhVl7e6_1DOMO7LaKMrv9389-f1vYOixhgNZkr8JkA-bHo0mxCYv2blzWox9e2R8BsnIEwg
  priority: 102
  providerName: ProQuest
Title Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
URI https://link.springer.com/article/10.1007/s10898-018-0728-9
https://www.proquest.com/docview/2157700417
Volume 73
WOSCitedRecordID wos000462013800002&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: Springer Journals New Starts & Take-Overs Collection
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: RSV
  dateStart: 19970101
  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/eLvHCXMwnV3db9MwED-xjQf2sLECWmFUfkDiS5byYcfx45g6IcFKxWAMXizHTkukLRtLNyH-eu5Spx2fEjzkJCsXx7Lv7LPu7ncAj3KlrPQq5lmpEi6US3gRi4IT-Bsu_2SStRlyR6_VaJQfH-txyONuumj3ziXZ7tTXkt1ySgeL8VEJaukKrEkCm6Er-uHREmk3b8vsRDqRXOIm3Lkyf9fFD4fRz1vyL77R9sjZ3_yvwd6GjWBhst25SGzBjbLuwWZXvYEFZe7B-jUoQmwdLPBbmx5sBa6GPQm41E_vQDWsPxM6Rz1lyMpqsnZPqm-lZ_OoREtxXgT4z3zV2Cle5KftsrMFTixDC5mdVl9Lz1uYChzOl0vrSQgdC5Fip9j_XXi_P3y395KHSg3cpTqfcRWJ1EqhIkfIn045b_HelUxiWRSpJ5Q_7zJrFdpDTk90LJwutYvSwssM5UOn92C1PqvLbWBeeZ_ZAvtCw8H71OYiiQol0dCyWui0D1G3ZMYFGHOqpnFilgDMNPcG597Q3Bvdh2eLT87nGB5_Y35McmBIv7FfZ0OaAo6OkLLMLh7mAuVYxH3Y6UTFBMVvDFpQiioGxKoPzzvRWL7-42_v_xP3A7iFhlvr1YrlDqzOLi7Lh3DTXc2q5mIAK-rDxwGsvRiOxm-x9UpxpAfRHtHkTUvHRNUh0rH8NGg16Dsj0Qws
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4hqNRyoEBbsZRSH1r1Jat5OHF8QBWiIBDLqgdacXMd27tEggCbpa8f1d_ITB5sHyo3Dj3klGSS2N88nPF8A_Ask9IkToY89TLiQtqI56HIOZG_4fQPh2ldIfepLweD7OhIfZiBn10tDG2r7GxibajdmaV_5G_RNUmiYg_lu_MLTl2jKLvatdBoYLHvv3_FJVu1sfce5_d5FO1sH27t8rarALexyiZcBiI2iZCBJZZKK60zuEaIhmGS57EjRjpnU2Mk-m6rhioUVnllgzh3SYrfQuRLaPLnBC68SK8Ogq0pyW9Wd_gJVJTwBO1_l0VtSvUyKmYL8ZAR2pjf_OCf3uCvtGzt7Xbu_2_jtAgLbVzNNhtFWIIZXy7D_C9si8uw1Nqxir1sybZfPYBiuzwmypFyxDAUZiWF8CfFD-9Ys9XS0OY16mLAXFGZ0WjsRzWW2TX5LcOwn50W37zjNfeGH7OLS-NIsyxrt7-dovyH8PFWBuARzJZnpV8B5qRzqclRFkZDzsUmE1GQywSjR6OEinsQdGDQtuVmpxYhJ3rKKk340YgfTfjRqgevr285b4hJbrr4BSFMk9FCuda0tRf4dkT_pTcxQhGonCLswVoHK91as0pPMdWDNx0wp6f_-djVm4U9hbu7hwd93d8b7D-GexiK1nm6MFmD2cn40j-BO_bLpKjG67WaMfh823i9AssVXtg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB5VBSE4tLSA2FLABxAvWc3b8QGhinZF1bL0AKg349jOEqlN280W2v40fh0zidPlIXrrgUNOSZzE_ubhzMw3AE9yIXRqRcgzJyKeCBPxIkwKTuRvuPxlmbUVcp93xGiU7-3J3Tn40dfCUFplrxNbRW0PDf0jX0PTJIiKPRRrpU-L2N0Yvjk65tRBiiKtfTuNDiLb7uw7bt-a11sbuNZPo2i4-fHtO-47DHATy3zKRZDEOk1EYIix0ghjNe4XojJMiyK2xE5nTaa1QDtuZCnDxEgnTRAXNs3wu4iICdX_NYEXknS9jz7MCH_ztttPIKOUp2gL-ohqV7aXU2FbiIeIUN_8ZhP_tAx_hWhbyzdc_J_n7DYseH-brXcCsgRzrl6GW7-wMC7DktdvDXvuSbhf3IFqs_5KVCT1mKGLzGpy7ferc2dZl4KpKamNuhswWzV6PJ64cYtxdkGKy3A7wA6qU2d5y8nhJuz4RFuSOMN8WtwBjn8XPl3JBNyD-fqwdveBWWFtpgscC70ka2OdJ1FQiBS9Si0TGQ8g6IGhjOdsp9Yh-2rGNk1YUoglRVhScgAvL2456ghLLrv4GaFNkTLDcY32NRn4dkQLptbRc0lQaJNwAKs9xJTXco2a4WsAr3qQzk7_87Erlw_2GG4gTNXO1mj7AdxED7UN34XpKsxPJyfuIVw336ZVM3nUShyDL1cN15_ai2e_
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=Enhancing+the+normalized+multiparametric+disaggregation+technique+for+mixed-integer+quadratic+programming&rft.jtitle=Journal+of+global+optimization&rft.au=Andrade%2C+Tiago&rft.au=Oliveira%2C+Fabricio&rft.au=Hamacher%2C+Silvio&rft.au=Eberhard%2C+Andrew&rft.date=2019-04-15&rft.pub=Springer+US&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=73&rft.issue=4&rft.spage=701&rft.epage=722&rft_id=info:doi/10.1007%2Fs10898-018-0728-9&rft.externalDocID=10_1007_s10898_018_0728_9
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon