A simple effective heuristic for embedded mixed-integer quadratic programming

In this paper, we propose a fast optimisation algorithm for approximately minimising convex quadratic functions over the intersection of affine and separable constraints (i.e. the Cartesian product of possibly nonconvex real sets). This problem class contains many NP-hard problems such as mixed-inte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of control Jg. 93; H. 1; S. 2 - 12
Hauptverfasser: Takapoui, Reza, Moehle, Nicholas, Boyd, Stephen, Bemporad, Alberto
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis 02.01.2020
Taylor & Francis Ltd
Schlagworte:
ISSN:0020-7179, 1366-5820
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this paper, we propose a fast optimisation algorithm for approximately minimising convex quadratic functions over the intersection of affine and separable constraints (i.e. the Cartesian product of possibly nonconvex real sets). This problem class contains many NP-hard problems such as mixed-integer quadratic programming. Our heuristic is based on a variation of the alternating direction method of multipliers (ADMM), an algorithm for solving convex optimisation problems. We discuss the favourable computational aspects of our algorithm, which allow it to run quickly even on very modest computational platforms such as embedded processors. We give several examples for which an approximate solution should be found very quickly, such as management of a hybrid-electric vehicle drivetrain and control of switched-mode power converters. Our numerical experiments suggest that our method is very effective in finding a feasible point with small objective value; indeed, we see that in many cases, it finds the global solution.
AbstractList In this paper, we propose a fast optimisation algorithm for approximately minimising convex quadratic functions over the intersection of affine and separable constraints (i.e. the Cartesian product of possibly nonconvex real sets). This problem class contains many NP-hard problems such as mixed-integer quadratic programming. Our heuristic is based on a variation of the alternating direction method of multipliers (ADMM), an algorithm for solving convex optimisation problems. We discuss the favourable computational aspects of our algorithm, which allow it to run quickly even on very modest computational platforms such as embedded processors. We give several examples for which an approximate solution should be found very quickly, such as management of a hybrid-electric vehicle drivetrain and control of switched-mode power converters. Our numerical experiments suggest that our method is very effective in finding a feasible point with small objective value; indeed, we see that in many cases, it finds the global solution.
Author Bemporad, Alberto
Takapoui, Reza
Boyd, Stephen
Moehle, Nicholas
Author_xml – sequence: 1
  givenname: Reza
  surname: Takapoui
  fullname: Takapoui, Reza
  email: takapoui@stanford.edu
  organization: Department of Electrical Engineering, Stanford University
– sequence: 2
  givenname: Nicholas
  surname: Moehle
  fullname: Moehle, Nicholas
  organization: Mechanical Engineering Department, Stanford University
– sequence: 3
  givenname: Stephen
  surname: Boyd
  fullname: Boyd, Stephen
  organization: Information Systems Laboratory, Department of Electrical Engineering, Stanford University
– sequence: 4
  givenname: Alberto
  surname: Bemporad
  fullname: Bemporad, Alberto
  organization: IMT Institute for Advanced Studies Lucca
BookMark eNqFkDtPwzAUhS1UJNrCT0CKxJziR5yHWKgqXlIRS3fLsa-Lq8Ru7RTovydRy8IA012-c87VN0Ej5x0gdE3wjOAS32JMcUGKakYxKWaEkRyT_AyNCcvzlJcUj9B4YNIBukCTGDcYE8ZLMkav8yTadttAAsaA6uwHJO-wDzZ2ViXGhwTaGrQGnbT2C3RqXQdrCMluL3WQA7QNfh1k21q3vkTnRjYRrk53ilaPD6vFc7p8e3pZzJepYqzsUgkgaUllQVUBNXBaVJyXps4KrpgpZJ7lvKKsZLU2OK-owdwwWamswprVhE3RzbG2n97tIXZi4_fB9YuCMkYyTijlPXV3pFTwMQYwQtmu_9i7LkjbCILFoE_86BODPnHS16f5r_Q22FaGw7-5-2POut5eKz99aLTo5KHxwQTplI2C_V3xDRCuiFc
CitedBy_id crossref_primary_10_1109_LCSYS_2019_2920164
crossref_primary_10_1109_TPWRS_2019_2892146
crossref_primary_10_1007_s13198_021_01321_6
crossref_primary_10_1016_j_apenergy_2021_116736
crossref_primary_10_1016_j_trc_2020_102960
crossref_primary_10_1016_j_jprocont_2024_103207
crossref_primary_10_1109_JSAC_2025_3549888
crossref_primary_10_1109_TAES_2025_3529426
crossref_primary_10_1016_j_arcontrol_2020_10_008
crossref_primary_10_1016_j_jclepro_2022_133908
crossref_primary_10_1109_TAC_2020_3007688
crossref_primary_10_1016_j_energy_2022_125971
crossref_primary_10_1061__ASCE_ST_1943_541X_0002843
crossref_primary_10_1109_TSG_2020_2995923
crossref_primary_10_1080_23249935_2024_2413655
crossref_primary_10_1109_TAES_2024_3448408
crossref_primary_10_1016_j_neunet_2024_106534
crossref_primary_10_1016_j_automatica_2023_111183
crossref_primary_10_1016_j_comnet_2021_108426
crossref_primary_10_1016_j_eswa_2021_114804
crossref_primary_10_1016_j_ifacol_2023_10_622
crossref_primary_10_1109_TPWRS_2024_3518580
crossref_primary_10_1109_TRO_2024_3435423
crossref_primary_10_1007_s13198_021_01516_x
crossref_primary_10_3233_JAE_240003
crossref_primary_10_1007_s10107_021_01656_9
crossref_primary_10_1109_TNNLS_2020_3045153
crossref_primary_10_1109_ACCESS_2020_2972346
crossref_primary_10_1016_j_enconman_2021_114167
crossref_primary_10_1016_j_segan_2025_101684
crossref_primary_10_3390_s20154324
crossref_primary_10_1016_j_ins_2024_121668
crossref_primary_10_1109_TVT_2023_3271656
crossref_primary_10_1016_j_asr_2018_01_025
crossref_primary_10_1007_s10846_019_01047_5
crossref_primary_10_1007_s10957_024_02448_9
crossref_primary_10_1108_IJSI_04_2024_0066
crossref_primary_10_1109_TAC_2021_3057061
crossref_primary_10_1109_TSG_2018_2880449
crossref_primary_10_1016_j_seta_2023_103470
crossref_primary_10_1007_s13198_021_01550_9
crossref_primary_10_1109_TITS_2022_3229254
crossref_primary_10_1016_j_rser_2021_111796
crossref_primary_10_1016_j_dsp_2023_104027
crossref_primary_10_1137_19M1271695
crossref_primary_10_1109_TSG_2021_3127518
crossref_primary_10_1109_TSG_2023_3310947
crossref_primary_10_1016_j_segan_2025_101890
crossref_primary_10_1541_ieejeiss_145_600
crossref_primary_10_1016_j_ifacol_2018_11_730
crossref_primary_10_1002_hyp_13473
crossref_primary_10_1109_JIOT_2020_3034925
crossref_primary_10_1115_1_4068504
crossref_primary_10_1016_j_apenergy_2022_120428
crossref_primary_10_1016_j_conengprac_2019_02_005
crossref_primary_10_1007_s13198_021_01602_0
crossref_primary_10_1137_22M1487321
crossref_primary_10_1109_TQE_2020_3033139
crossref_primary_10_1177_0142331219895117
crossref_primary_10_1016_j_neucom_2024_127327
crossref_primary_10_1080_10556788_2023_2285492
crossref_primary_10_3390_app14167184
crossref_primary_10_1007_s00158_018_1946_y
crossref_primary_10_1007_s11081_017_9372_3
crossref_primary_10_1109_TSTE_2018_2890621
crossref_primary_10_1016_j_media_2024_103277
Cites_doi 10.1109/TIE.2009.2025283
10.1109/4234.846498
10.1137/1.9781611973655
10.1109/ICASSP.2011.5946267
10.1109/TCST.2012.2231960
10.1109/CDC.2014.7040179
10.1016/j.ifacol.2015.11.264
10.1109/DATE.2012.6176508
10.1007/s10898-015-0287-2
10.1007/s101070050103
10.1016/S0005-1098(98)00178-2
10.1109/TPWRS.2006.876672
10.1109/LCOMM.2007.061618
10.1016/0898-1221(76)90003-1
10.1017/CBO9780511804441
10.1109/TIP.2012.2202677
10.23919/ECC.2013.6669712
10.1137/0211045
10.1109/JPROC.2006.890127
10.1109/TSP.2007.906734
10.1007/BF02165096
10.23919/ECC.2013.6669541
10.1137/1.9781611974010.52
10.3182/20140824-6-ZA-1003.00295
10.1109/CDC.2014.7040175
10.1007/BF02592208
10.1109/63.471281
10.1016/j.compchemeng.2014.06.005
10.1109/18.771234
10.1109/ICASSP.2013.6638818
10.1007/BF01531077
10.1109/TCST.2009.2017934
10.1109/TAC.2014.2354892
10.1007/s12532-014-0071-1
10.1109/CDC.2014.7040176
10.1287/opre.14.4.699
10.1007/BF01580121
10.3182/20120711-3-BE-2027.00310
10.1109/ICASSP.2015.7178689
10.1137/140998135
10.1561/2200000016
10.1137/S0363012902400713
10.1051/m2an/197509R200411
10.1109/ACSSC.2008.5074726
10.1016/j.disopt.2006.10.004
10.1007/BF01589405
10.2200/S00047ED1V01Y200609PEL002
10.1109/MCS.2011.940571
10.1137/120878951
10.1016/j.mechatronics.2011.12.001
10.1016/j.epsr.2006.09.020
10.1109/TPWRS.2014.2306495
10.1007/s11081-011-9176-9
10.1109/TSP.2015.2454476
10.1007/s10107-004-0570-3
10.1090/S0002-9904-1958-10224-4
10.1016/j.enconman.2009.10.017
10.1016/0024-3795(89)90476-X
10.1007/s11464-012-0194-5
10.1109/TSP.2012.2208955
10.1109/TSP.2014.2304432
10.1007/978-1-4684-2001-2_9
10.1016/j.disopt.2006.10.001
10.1109/PSCC.2014.7038447
ContentType Journal Article
Copyright 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
2017 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
– notice: 2017 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207179.2017.1316016
DatabaseName CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-5820
EndPage 12
ExternalDocumentID 10_1080_00207179_2017_1316016
1316016
Genre Article
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACBEA
ACGEJ
ACGFO
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADIYS
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBS
E~A
E~B
F5P
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Z
NA5
NX~
O9-
P2P
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-aeea282a72c7ebe5279558fb475c3f7a646592383bdf0692f05f3a9c490d3b13
IEDL.DBID TFW
ISICitedReferencesCount 109
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000576172600003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7179
IngestDate Sun Nov 30 04:07:28 EST 2025
Sat Nov 29 05:46:10 EST 2025
Tue Nov 18 21:19:30 EST 2025
Mon Oct 20 23:48:56 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c338t-aeea282a72c7ebe5279558fb475c3f7a646592383bdf0692f05f3a9c490d3b13
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2331451225
PQPubID 176145
PageCount 11
ParticipantIDs informaworld_taylorfrancis_310_1080_00207179_2017_1316016
proquest_journals_2331451225
crossref_primary_10_1080_00207179_2017_1316016
crossref_citationtrail_10_1080_00207179_2017_1316016
PublicationCentury 2000
PublicationDate 2020-01-02
PublicationDateYYYYMMDD 2020-01-02
PublicationDate_xml – month: 01
  year: 2020
  text: 2020-01-02
  day: 02
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of control
PublicationYear 2020
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References cit0033
cit0077
cit0111
cit0031
cit0032
cit0073
Wolsey L.A. (cit0131) 1998
cit0030
Beasley J.E (cit0006) 1998
cit0118
cit0119
cit0039
cit0116
cit0117
cit0038
cit0035
cit0113
cit0022
cit0100
cit0020
cit0064
cit0021
Li R. (cit0085) 2004
Glover I. (cit0056) 2010
cit0061
IBM ILOG CPLEX (cit0066) 2009
Jiang B. (cit0074) 2014
Zhang R. (cit0135) 2014
Bradley A.M. (cit0023) 2010
Wright S.J. (cit0133) 1999
Sedghi H. (cit0115) 2014
cit0108
cit0028
cit0105
cit0029
cit0106
cit0103
cit0027
cit0024
cit0025
cit0099
cit0012
cit0053
MOSEK ApS (cit0098) 2015
cit0130
cit0054
cit0051
cit0052
cit0050
cit0091
cit0090
Papadimitriou C.H. (cit0107) 1998
Muta K. (cit0102) 2004; 113
Ullmann F. (cit0122) 2011
cit0015
cit0013
cit0057
cit0134
cit0058
cit0088
cit0042
cit0043
cit0087
cit0120
cit0040
cit0084
cit0080
Deng W. (cit0036) 2012; 66
cit0008
cit0009
cit0007
cit0128
cit0125
cit0005
cit0126
cit0002
cit0046
cit0047
cit0124
References_xml – ident: cit0025
  doi: 10.1109/TIE.2009.2025283
– ident: cit0035
  doi: 10.1109/4234.846498
– start-page: 879
  volume-title: Proceedings of the 2004 Asia and South Pacific design automation conference
  year: 2004
  ident: cit0085
– ident: cit0007
  doi: 10.1137/1.9781611973655
– start-page: 883
  year: 2014
  ident: cit0074
  publication-title: Optional,
– volume-title: The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 28)
  year: 2015
  ident: cit0098
– volume: 113
  start-page: 182
  issue: 3
  year: 2004
  ident: cit0102
  publication-title: SAE Transactions,
– ident: cit0099
  doi: 10.1109/ICASSP.2011.5946267
– ident: cit0103
  doi: 10.1109/TCST.2012.2231960
– ident: cit0053
  doi: 10.1109/CDC.2014.7040179
– ident: cit0008
  doi: 10.1016/j.ifacol.2015.11.264
– ident: cit0029
  doi: 10.1109/DATE.2012.6176508
– ident: cit0111
  doi: 10.1007/s10898-015-0287-2
– ident: cit0120
  doi: 10.1007/s101070050103
– ident: cit0009
  doi: 10.1016/S0005-1098(98)00178-2
– ident: cit0027
  doi: 10.1109/TPWRS.2006.876672
– volume-title: FiOrdOs: A Matlab toolbox for C-code generation for first order methods
  year: 2011
  ident: cit0122
– volume-title: Heuristic algorithms for the unconstrained binary quadratic programming problem
  year: 1998
  ident: cit0006
– ident: cit0105
  doi: 10.1109/LCOMM.2007.061618
– ident: cit0047
  doi: 10.1016/0898-1221(76)90003-1
– volume-title: Integer programming
  year: 1998
  ident: cit0131
– ident: cit0021
  doi: 10.1017/CBO9780511804441
– ident: cit0126
  doi: 10.1109/TIP.2012.2202677
– ident: cit0032
  doi: 10.23919/ECC.2013.6669712
– ident: cit0061
  doi: 10.1137/0211045
– ident: cit0130
  doi: 10.1109/JPROC.2006.890127
– ident: cit0113
  doi: 10.1109/TSP.2007.906734
– ident: cit0118
  doi: 10.1007/BF02165096
– ident: cit0039
  doi: 10.23919/ECC.2013.6669541
– ident: cit0005
  doi: 10.1137/1.9781611974010.52
– ident: cit0051
  doi: 10.3182/20140824-6-ZA-1003.00295
– ident: cit0052
  doi: 10.1109/CDC.2014.7040175
– ident: cit0015
  doi: 10.1007/BF02592208
– ident: cit0119
  doi: 10.1109/63.471281
– ident: cit0046
  doi: 10.1016/j.compchemeng.2014.06.005
– ident: cit0124
  doi: 10.1109/18.771234
– volume-title: Numerical optimization
  year: 1999
  ident: cit0133
– ident: cit0031
  doi: 10.1109/ICASSP.2013.6638818
– ident: cit0073
  doi: 10.1007/BF01531077
– volume-title: User's manual for CPLEX
  year: 2009
  ident: cit0066
– ident: cit0128
  doi: 10.1109/TCST.2009.2017934
– ident: cit0050
  doi: 10.1109/TAC.2014.2354892
– ident: cit0042
  doi: 10.1007/s12532-014-0071-1
– ident: cit0054
  doi: 10.1109/CDC.2014.7040176
– ident: cit0080
  doi: 10.1287/opre.14.4.699
– volume-title: Digital communications
  year: 2010
  ident: cit0056
– ident: cit0106
  doi: 10.1007/BF01580121
– volume-title: Combinatorial optimization: Algorithms and complexity
  year: 1998
  ident: cit0107
– ident: cit0125
  doi: 10.3182/20120711-3-BE-2027.00310
– ident: cit0064
  doi: 10.1109/ICASSP.2015.7178689
– ident: cit0084
  doi: 10.1137/140998135
– ident: cit0022
  doi: 10.1561/2200000016
– ident: cit0038
  doi: 10.1137/S0363012902400713
– ident: cit0057
  doi: 10.1051/m2an/197509R200411
– ident: cit0117
  doi: 10.1109/ACSSC.2008.5074726
– volume: 66
  start-page: 1
  year: 2012
  ident: cit0036
  publication-title: Journal of Scientific Computing,
– ident: cit0002
  doi: 10.1016/j.disopt.2006.10.004
– ident: cit0013
  doi: 10.1007/BF01589405
– volume-title: Algorithms for the equilibration of matrices and their application to limited-memory quasi-newton methods
  year: 2010
  ident: cit0023
– ident: cit0024
  doi: 10.2200/S00047ED1V01Y200609PEL002
– start-page: 2771
  volume-title: Advances in neural information processing systems
  year: 2014
  ident: cit0115
– start-page: 1701
  volume-title: ICML
  year: 2014
  ident: cit0135
– ident: cit0091
  doi: 10.1109/MCS.2011.940571
– ident: cit0020
  doi: 10.1137/120878951
– ident: cit0100
  doi: 10.1016/j.mechatronics.2011.12.001
– ident: cit0108
  doi: 10.1016/j.epsr.2006.09.020
– ident: cit0040
  doi: 10.1109/TPWRS.2014.2306495
– ident: cit0090
  doi: 10.1007/s11081-011-9176-9
– ident: cit0087
  doi: 10.1109/TSP.2015.2454476
– ident: cit0043
  doi: 10.1007/s10107-004-0570-3
– ident: cit0058
  doi: 10.1090/S0002-9904-1958-10224-4
– ident: cit0028
  doi: 10.1016/j.enconman.2009.10.017
– ident: cit0033
  doi: 10.1016/0024-3795(89)90476-X
– ident: cit0134
  doi: 10.1007/s11464-012-0194-5
– ident: cit0030
  doi: 10.1109/TSP.2012.2208955
– ident: cit0116
  doi: 10.1109/TSP.2014.2304432
– ident: cit0077
  doi: 10.1007/978-1-4684-2001-2_9
– ident: cit0012
  doi: 10.1016/j.disopt.2006.10.001
– ident: cit0088
  doi: 10.1109/PSCC.2014.7038447
SSID ssj0013581
Score 2.5807006
Snippet In this paper, we propose a fast optimisation algorithm for approximately minimising convex quadratic functions over the intersection of affine and separable...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2
SubjectTerms ADMM
Algorithms
Cartesian coordinates
embedded applications
Embedded systems
heuristic
Hybrid electric vehicles
Integers
Mathematical analysis
Mixed-integer quadratic programming
Optimization
Power converters
Powertrain
Quadratic equations
Quadratic programming
Title A simple effective heuristic for embedded mixed-integer quadratic programming
URI https://www.tandfonline.com/doi/abs/10.1080/00207179.2017.1316016
https://www.proquest.com/docview/2331451225
Volume 93
WOSCitedRecordID wos000576172600003&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1366-5820
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013581
  issn: 0020-7179
  databaseCode: TFW
  dateStart: 19650101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0ShIA-srpLYqeOxQlQMUDFUolvkp6hECzQp4ufjS5zSCqEOMHo4y7o7n_3Zd98hdG09uDE6zYiRkSVMxIZIwRyxgvlBpqg2laXv-XCYjcfiMWQTFiGtEjC0q4kiqlgNm1uqosmIgwpuQCFQZhLzbkxjoBTxUdgf_bA1R4On73-ENKt75nmQBCJNDc9vs6ydTmvcpT9idXUADfb_YekHaC_cPnG_dpdDtGVnR2h3hZPwGD30cTEBymBcp3r4aIif7aImdMZ-pdhOlfXhyuDp5NMaUhFO2Dl-X0gD7qRxyPma-vlO0GhwO7q5I6HnAtEerJZEWis9CpM80dzbN024SNPMKcZTTR2XPQb_sB7WKuOinkhclDoqhWYiMlTF9BS1Zq8ze4Ywl4or7VSsdMLg3pPE0lnLI6BEi7hoI9aoOteBjxzaYrzk8ZK2tFZWDsrKg7LaqLsUe6sJOTYJiFU75mX1EuLqtiU53SDbaYyeh71d5Aml0N7YB8LzP0x9gXYS8Ep4zUk6qFXOF_YSbeuPclLMryov_gInU-vY
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LTwIxEG4UTdSDbyOK2oPXJbvbXbo9EiPBCJw2kVvTZyQRVFiMP9_OPhBiDAc99jBNMzOd9mtnvkHo1jhwo1WceFr4xotYoD3BIusZFrlBIonSuaV7dDBIhkO2XAsDaZWAoW1BFJHHatjc8BhdpcRBCTfAEKgzCWgzIAFwimyirdidtcCfn3aevn8S4qTomudgEshUVTy_TbNyPq2wl_6I1vkR1Dn4j8Ufov3yAorbhcccoQ0zOUZ7S7SEJ6jfxrMRsAbjItvDBUT8bOYFpzN2S8VmLI2LWBqPR59GeznnhJni97nQ4FEKl2lfYzffKUo79-ld1yvbLnjK4dXME8YIB8QEDRV1Jo5DyuI4sTKisSKWilYEX7EO2Upt_RYLrR9bIpiKmK-JDMgZqk1eJ-YcYSoklcrKQKowgqtPGAhrDPWBFc2nrI6iStdclZTk0BnjhQcL5tJCWRyUxUtl1VFzIfZWcHKsE2DLhuRZ_hhii84lnKyRbVRW5-X2nvGQEOhw7GLhxR-mvkE73bTf472HweMl2g3BReFxJ2ygWjadmyu0rT6y0Wx6nbv0Fyr-8AI
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5aRfTgW6xWzcHrlt3NbrM5FnVRrKWHgr2FPLFga-1D_Plm9lFbRHrQYw4Twsxkki-Z-Qaha-PAjVZx4mnhGy9igfYEi6xnWOQGiSRKZ5Zu0XY76fVYp8gmnBRplYChbU4UkcVq2NwjbcuMOKjgBhQCZSYBrQckAEqRdbThrs4NcPJu-vz9kRAnedM8h5JApizi-W2apeNpibz0R7DOTqB07x_Wvo92i-snbub-coDWzPAQ7SyQEh6hpyae9IEzGOe5Hi4c4hczyxmdsVspNgNpXLzSeND_NNrLGCfMGL_PhAZ_UrhI-hq4-Y5RN73r3tx7RdMFTzm0OvWEMcLBMEFDRZ2B45CyOE6sjGisiKWiEcFHrMO1Ulu_wULrx5YIpiLmayIDcoIqw7ehOUWYCkmlsjKQKozg4hMGwhpDfeBE8ymroqhUNVcFITn0xXjlwZy3NFcWB2XxQllVVJ-LjXJGjlUCbNGOfJo9hdi8bwknK2RrpdF5sbknPCQE-hu7SHj2h6mv0FbnNuWth_bjOdoOwUHhZSesocp0PDMXaFN9TPuT8WXm0F9Ymu60
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=A+simple+effective+heuristic+for+embedded+mixed-integer+quadratic+programming&rft.jtitle=International+journal+of+control&rft.au=Takapoui%2C+Reza&rft.au=Moehle%2C+Nicholas&rft.au=Boyd%2C+Stephen&rft.au=Bemporad%2C+Alberto&rft.date=2020-01-02&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=0020-7179&rft.eissn=1366-5820&rft.volume=93&rft.issue=1&rft.spage=2&rft_id=info:doi/10.1080%2F00207179.2017.1316016&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7179&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7179&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7179&client=summon