Further elaborations on topology optimization via sequential integer programming and Canonical relaxation algorithm and 128-line MATLAB code

This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm. Firstly, discrete variable topology optimization problem for minimum compliance subject to a material volume constraint is formulated and approxi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Structural and multidisciplinary optimization Ročník 61; číslo 1; s. 411 - 431
Hlavní autoři:	Liang, Yuan, Cheng, Gengdong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2020 Springer Nature B.V
Témata:	Algorithms Computational Mathematics and Numerical Analysis Continuity (mathematics) Educational Paper Engineering Engineering Design Integer programming Integers Matlab Optimization Sensitivity Theoretical and Applied Mechanics Topology optimization Discrete variable topology optimization Sequential approximate programming (SAP) Canonical relaxation algorithm MATLAB
ISSN:	1615-147X, 1615-1488
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm. Firstly, discrete variable topology optimization problem for minimum compliance subject to a material volume constraint is formulated and approximated by a sequence of discrete variable sub-programming with the discrete variable sensitivity. The differences between continuous variable sensitivity and discrete variable sensitivity are discussed. Secondly, the Canonical relaxation algorithm designed to solve this sub-programming is presented with a discussion on the move limit strategy. Based on the discussion above, a compact 128-line MATLAB code to implement the new method is included in Appendix 1 . As shown by numerical experiments, the 128-line code can maintain black-white solutions during the optimization process. The code can be treated as the foundation for other problems with multiple constraints.
AbstractList	This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm. Firstly, discrete variable topology optimization problem for minimum compliance subject to a material volume constraint is formulated and approximated by a sequence of discrete variable sub-programming with the discrete variable sensitivity. The differences between continuous variable sensitivity and discrete variable sensitivity are discussed. Secondly, the Canonical relaxation algorithm designed to solve this sub-programming is presented with a discussion on the move limit strategy. Based on the discussion above, a compact 128-line MATLAB code to implement the new method is included in Appendix 1. As shown by numerical experiments, the 128-line code can maintain black-white solutions during the optimization process. The code can be treated as the foundation for other problems with multiple constraints. This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm. Firstly, discrete variable topology optimization problem for minimum compliance subject to a material volume constraint is formulated and approximated by a sequence of discrete variable sub-programming with the discrete variable sensitivity. The differences between continuous variable sensitivity and discrete variable sensitivity are discussed. Secondly, the Canonical relaxation algorithm designed to solve this sub-programming is presented with a discussion on the move limit strategy. Based on the discussion above, a compact 128-line MATLAB code to implement the new method is included in Appendix 1 . As shown by numerical experiments, the 128-line code can maintain black-white solutions during the optimization process. The code can be treated as the foundation for other problems with multiple constraints.
Author	Liang, Yuan Cheng, Gengdong
Author_xml	– sequence: 1 givenname: Yuan surname: Liang fullname: Liang, Yuan organization: State Key Laboratory of Structural Analysis for Industrial Equipment, Department of Engineering Mechanics, International Research Center for Computational Mechanics, Dalian University of Technology – sequence: 2 givenname: Gengdong surname: Cheng fullname: Cheng, Gengdong email: chenggd@dlut.edu.cn organization: State Key Laboratory of Structural Analysis for Industrial Equipment, Department of Engineering Mechanics, International Research Center for Computational Mechanics, Dalian University of Technology
BookMark	eNp9kM1OGzEUha0qSE2AF2Blqetpr-35sZdpRChSEBuQ2Fkej2cwmrFT20GFZ-hDYzJVK3XBylfy-c4996zQwnlnELog8JUANN8iAKl4AUQUQJmoC_YJLUlNqoKUnC_-zs3DZ7SK8QkAOJRiiX5vDyE9moDNqFofVLLeRewdTn7vRz-8YL9PdrKvxx_8bBWO5ufBuGTViK1LZsjwPvghqGmybsDKdXijcj6rsyJk318zq8bBB5sep6OEUF6M1hl8s77brb9j7Ttzhk56NUZz_uc9Rffby7vNj2J3e3W9We8KzXiVirKuWSUU7ZqKCwVdbTreiLaDNpdQlQpIX7W1ok0tet1qUfVMCK65ppQCaSk7RV9m35w73xKTfPKH4PJKSVnJWLYVkFV0VungYwyml_tgJxVeJAH53rqcW5e5dXlsXbIM8f8gbdPx_hSUHT9G2YzGvMflWv-l-oB6A8bwmpw
CitedBy_id	crossref_primary_10_1016_j_finel_2021_103690 crossref_primary_10_1038_s41598_025_15200_8 crossref_primary_10_32604_cmes_2023_027603 crossref_primary_10_1007_s10957_023_02222_3 crossref_primary_10_1007_s10409_023_23151_x crossref_primary_10_1016_j_istruc_2023_04_120 crossref_primary_10_1007_s00158_022_03321_x crossref_primary_10_1016_j_cma_2021_114302 crossref_primary_10_1016_j_cma_2023_116409 crossref_primary_10_1007_s00158_023_03702_w crossref_primary_10_1016_j_compstruc_2024_107292 crossref_primary_10_1016_j_cma_2021_114000 crossref_primary_10_1109_TQE_2023_3266410 crossref_primary_10_1007_s00158_021_03050_7 crossref_primary_10_32604_cmes_2023_024921 crossref_primary_10_3390_ma18102394 crossref_primary_10_3390_app132312916 crossref_primary_10_1007_s00158_020_02693_2 crossref_primary_10_7717_peerj_cs_1863 crossref_primary_10_1007_s00158_025_04030_x crossref_primary_10_1007_s00158_020_02816_9 crossref_primary_10_1038_s41598_022_20248_x crossref_primary_10_1088_1757_899X_1307_1_012022 crossref_primary_10_1007_s00158_023_03718_2 crossref_primary_10_1007_s00158_021_02910_6 crossref_primary_10_1007_s00158_022_03464_x crossref_primary_10_1016_j_cad_2023_103482 crossref_primary_10_1007_s00158_021_02917_z crossref_primary_10_1088_2040_8986_adf654 crossref_primary_10_1007_s00158_025_03961_9 crossref_primary_10_1016_j_cma_2021_114202 crossref_primary_10_1002_nme_6775 crossref_primary_10_1016_j_cma_2023_116701 crossref_primary_10_1007_s11831_025_10285_w crossref_primary_10_1007_s00158_023_03590_0 crossref_primary_10_32604_cmes_2023_025153 crossref_primary_10_1007_s00158_022_03201_4 crossref_primary_10_1007_s00158_020_02733_x crossref_primary_10_1016_j_advengsoft_2024_103790 crossref_primary_10_1080_0305215X_2024_2445653 crossref_primary_10_1002_nme_7449 crossref_primary_10_1016_j_cma_2024_117151 crossref_primary_10_1007_s11081_023_09808_w crossref_primary_10_1007_s00158_025_03975_3 crossref_primary_10_1007_s00158_020_02719_9 crossref_primary_10_3390_computation13010006 crossref_primary_10_32604_cmes_2022_020327 crossref_primary_10_1002_adem_202402567 crossref_primary_10_1007_s00158_020_02598_0 crossref_primary_10_1007_s00158_021_02858_7 crossref_primary_10_1007_s11081_021_09675_3 crossref_primary_10_1016_j_apm_2024_115692 crossref_primary_10_32604_cmes_2023_026043 crossref_primary_10_1109_ACCESS_2022_3206368
Cites_doi	10.1007/s004190050248 10.1016/0045-7825(88)90086-2 10.1007/s00158-018-1904-8 10.1007/s001580050176 10.1007/BF01197709 10.1108/02644409810244129 10.1002/nme.5432 10.1016/j.commatsci.2018.08.008 10.1007/s001580050170 10.1002/nme.1620240207 10.1016/j.finel.2017.10.006 10.1007/s10483-007-0601-z 10.1016/j.cma.2018.10.050 10.1023/A:1026537630859 10.1002/nme.1677 10.1007/s00158-009-0443-8 10.1002/nme.4367 10.1007/s00158-013-0978-6 10.1007/s00158-010-0594-7 10.1016/j.ijsolstr.2007.08.027 10.1007/s00158-010-0574-y 10.1016/0045-7949(93)90035-C 10.1007/s00158-011-0638-7 10.1002/nme.6005
ContentType	Journal Article
Copyright	Springer-Verlag GmbH Germany, part of Springer Nature 2019 Structural and Multidisciplinary Optimization is a copyright of Springer, (2019). All Rights Reserved.
Copyright_xml	– notice: Springer-Verlag GmbH Germany, part of Springer Nature 2019 – notice: Structural and Multidisciplinary Optimization is a copyright of Springer, (2019). All Rights Reserved.
DBID	AAYXX CITATION 8FE 8FG ABJCF AFKRA BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS
DOI	10.1007/s00158-019-02396-3
DatabaseName	CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland ProQuest Central Technology Collection ProQuest One ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) 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
DatabaseTitle	CrossRef Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic ProQuest Central (New) Engineering Collection ProQuest One Academic (New)
DatabaseTitleList	Engineering Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1615-1488
EndPage	431
ExternalDocumentID	10_1007_s00158_019_02396_3
GroupedDBID	-5B -5G -BR -EM -Y2 -~C .86 .VR 06D 0R~ 0VY 123 199 1N0 2.D 203 29Q 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 78A 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF 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 ACSNA ACZOJ ADHIR ADINQ ADKNI ADKPE ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARCEE ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ 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 JBSCW JCJTX JZLTJ KDC KOV L6V LAS LLZTM M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9P PF0 PT4 PT5 PTHSS QOK QOS R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDH SDM SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7X Z7Y Z7Z Z81 Z83 Z85 Z86 Z88 Z8M Z8N Z8P Z8R Z8S Z8T Z8U Z8W Z8Z Z92 ZMTXR _50 ~02 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB DWQXO PKEHL PQEST PQQKQ PQUKI PRINS
ID	FETCH-LOGICAL-c385t-466359a2d7589a0d6ed879bd0b01554a01f5b6a2769fcbc95f3998c8c22201b23
IEDL.DBID	RSV
ISICitedReferencesCount	58
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000511324900024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1615-147X
IngestDate	Tue Nov 04 23:42:06 EST 2025 Tue Nov 18 21:45:00 EST 2025 Sat Nov 29 02:50:14 EST 2025 Fri Feb 21 02:35:15 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Discrete variable topology optimization Sequential approximate programming (SAP) Canonical relaxation algorithm MATLAB
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c385t-466359a2d7589a0d6ed879bd0b01554a01f5b6a2769fcbc95f3998c8c22201b23
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2343358990
PQPubID	2043658
PageCount	21
ParticipantIDs	proquest_journals_2343358990 crossref_primary_10_1007_s00158_019_02396_3 crossref_citationtrail_10_1007_s00158_019_02396_3 springer_journals_10_1007_s00158_019_02396_3
PublicationCentury	2000
PublicationDate	2020-01-01
PublicationDateYYYYMMDD	2020-01-01
PublicationDate_xml	– month: 01 year: 2020 text: 2020-01-01 day: 01
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationTitle	Structural and multidisciplinary optimization
PublicationTitleAbbrev	Struct Multidisc Optim
PublicationYear	2020
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Sigmund, Maute (CR18) 2013; 48 Liang, Cheng (CR11) 2019; 348 Bendsoe, Sigmund (CR4) 1999; 69 Groen, Langelaar, Sigmund, Ruess (CR10) 2017; 110 Andreassen, Clausen, Schevenels, Lazarov, Sigmund (CR1) 2010; 43 CR13 Browne, Budd, Gould, Kim, Scott (CR6) 2012; 92 Bendsøe, Kikuchi (CR3) 1988; 71 Gao (CR7) 2000; 17 Sivapuram, Picelli (CR19) 2018; 139 Querin, Steven, Xie (CR15) 1998; 15 Bertsekas (CR5) 1982 Zhou, Rozvany (CR26) 2001; 21 Svanberg (CR22) 1987; 24 CR8 Sivapuram, Picelli, Xie (CR20) 2018; 154 Nguyen, Paulino, Song, Le (CR14) 2010; 41 Xie, Steven (CR25) 1993; 49 Beckers (CR2) 1999; 17 Sigmund (CR17) 2011; 43 Stolpe, Bendsoe (CR21) 2011; 43 Mei, Wang, Cheng (CR12) 2007; 28 Gao, Yu (CR9) 2008; 45 Wei, Li, Li (CR24) 2018; 58 Sigmund (CR16) 2001; 21 Svanberg, Werme (CR23) 2006; 67 OM Querin (2396_CR15) 1998; 15 M Stolpe (2396_CR21) 2011; 43 JP Groen (2396_CR10) 2017; 110 P. A. Browne (2396_CR6) 2012; 92 2396_CR8 O Sigmund (2396_CR18) 2013; 48 YM Xie (2396_CR25) 1993; 49 DY Gao (2396_CR7) 2000; 17 R Sivapuram (2396_CR19) 2018; 139 K Svanberg (2396_CR23) 2006; 67 O Sigmund (2396_CR17) 2011; 43 M Zhou (2396_CR26) 2001; 21 Raghavendra Sivapuram (2396_CR20) 2018; 154 K Svanberg (2396_CR22) 1987; 24 YL Mei (2396_CR12) 2007; 28 Erik Andreassen (2396_CR1) 2010; 43 DP Bertsekas (2396_CR5) 1982 P Wei (2396_CR24) 2018; 58 TH Nguyen (2396_CR14) 2010; 41 O. Sigmund (2396_CR16) 2001; 21 2396_CR13 MP Bendsøe (2396_CR3) 1988; 71 Y Liang (2396_CR11) 2019; 348 MP Bendsoe (2396_CR4) 1999; 69 DY Gao (2396_CR9) 2008; 45 M Beckers (2396_CR2) 1999; 17
References_xml	– volume: 69 start-page: 635 year: 1999 end-page: 654 ident: CR4 article-title: Material interpolation schemes in topology optimization publication-title: Arch Appl Mech doi: 10.1007/s004190050248 – volume: 71 start-page: 197 issue: 2 year: 1988 end-page: 224 ident: CR3 article-title: Generating optimal topologies in structural design using a homogenization method publication-title: Comput Methods Appl Mech Eng doi: 10.1016/0045-7825(88)90086-2 – volume: 58 start-page: 831 year: 2018 end-page: 849 ident: CR24 article-title: An 88-line matlab code for the parameterized level set method based topology optimization using radial basis functions publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-018-1904-8 – volume: 21 start-page: 120 issue: 2 year: 2001 end-page: 127 ident: CR16 article-title: A 99 line topology optimization code written in Matlab publication-title: Structural and Multidisciplinary Optimization doi: 10.1007/s001580050176 – volume: 17 start-page: 14 year: 1999 end-page: 24 ident: CR2 article-title: Topology optimization using a dual method with discrete variables publication-title: Struct Optim doi: 10.1007/BF01197709 – volume: 15 start-page: 1031 year: 1998 end-page: 1048 ident: CR15 article-title: Evolutionary structural optimization(ESO) using a bidirectional algorithm publication-title: Eng Comput doi: 10.1108/02644409810244129 – volume: 110 start-page: 903 issue: 10 year: 2017 end-page: 920 ident: CR10 article-title: Higher-order multi-resolution topology optimization using the finite cell method publication-title: Int J Numer Methods Eng doi: 10.1002/nme.5432 – volume: 154 start-page: 405 year: 2018 end-page: 425 ident: CR20 article-title: Topology optimization of binary microstructures involving various non-volume constraints publication-title: Computational Materials Science doi: 10.1016/j.commatsci.2018.08.008 – year: 1982 ident: CR5 publication-title: Constrained optimization and Lagrange multiplier methods – ident: CR8 – volume: 21 start-page: 80 issue: 1 year: 2001 end-page: 83 ident: CR26 article-title: On the validity of ESO type methods in topology optimization publication-title: Struct Multidiscip Optim doi: 10.1007/s001580050170 – volume: 24 start-page: 359 issue: 2 year: 1987 end-page: 373 ident: CR22 article-title: The method of moving asymptotesa––new method for structural optimization publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1620240207 – volume: 139 start-page: 49 year: 2018 end-page: 61 ident: CR19 article-title: Topology optimization of binary structures using Integer Linear Programming publication-title: Finite Elem Anal Des doi: 10.1016/j.finel.2017.10.006 – volume: 28 start-page: 707 issue: 6 year: 2007 end-page: 719 ident: CR12 article-title: Binary discrete method of topology optimization publication-title: Appl Math Mech doi: 10.1007/s10483-007-0601-z – volume: 348 start-page: 64 year: 2019 end-page: 96 ident: CR11 article-title: Topology optimization via sequential integer programming and canonical relaxation algorithm publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2018.10.050 – volume: 17 start-page: 127 issue: 1–4 year: 2000 end-page: 160 ident: CR7 article-title: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization publication-title: J Glob Optim doi: 10.1023/A:1026537630859 – volume: 67 start-page: 1670 year: 2006 end-page: 1699 ident: CR23 article-title: Topology optimization by neighbourhood search method based on efficient sensitivity calculations publication-title: Int J Numer Methods Eng doi: 10.1002/nme.1677 – ident: CR13 – volume: 41 start-page: 525 issue: 4 year: 2010 end-page: 539 ident: CR14 article-title: A computational paradigm for multiresolution topology optimization (MTOP) publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-009-0443-8 – volume: 92 start-page: 1026 issue: 12 year: 2012 end-page: 1043 ident: CR6 article-title: A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints publication-title: International Journal for Numerical Methods in Engineering doi: 10.1002/nme.4367 – volume: 48 start-page: 1031 issue: 6 year: 2013 end-page: 1055 ident: CR18 article-title: Topology optimization approaches: a comparative review publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-013-0978-6 – volume: 43 start-page: 1 issue: 1 year: 2010 end-page: 16 ident: CR1 article-title: Efficient topology optimization in MATLAB using 88 lines of code publication-title: Structural and Multidisciplinary Optimization doi: 10.1007/s00158-010-0594-7 – volume: 45 start-page: 3660 issue: 13 year: 2008 end-page: 3673 ident: CR9 article-title: Multi-scale modelling and canonical dual finite element method in phase transitions of solids publication-title: Int J Solids Struct doi: 10.1016/j.ijsolstr.2007.08.027 – volume: 43 start-page: 151 year: 2011 end-page: 164 ident: CR21 article-title: Global optima for the Zhou Rozvany problem publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-010-0574-y – volume: 49 start-page: 885 year: 1993 end-page: 896 ident: CR25 article-title: A simple evolutionary procedure for structural optimization publication-title: Comput Struct doi: 10.1016/0045-7949(93)90035-C – volume: 43 start-page: 589 issue: 5 year: 2011 end-page: 596 ident: CR17 article-title: On the usefulness of non-gradient approaches in topology optimization publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-011-0638-7 – volume: 43 start-page: 589 issue: 5 year: 2011 ident: 2396_CR17 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-011-0638-7 – volume: 110 start-page: 903 issue: 10 year: 2017 ident: 2396_CR10 publication-title: Int J Numer Methods Eng doi: 10.1002/nme.5432 – volume: 348 start-page: 64 year: 2019 ident: 2396_CR11 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2018.10.050 – volume: 154 start-page: 405 year: 2018 ident: 2396_CR20 publication-title: Computational Materials Science doi: 10.1016/j.commatsci.2018.08.008 – volume: 43 start-page: 151 year: 2011 ident: 2396_CR21 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-010-0574-y – ident: 2396_CR13 doi: 10.1002/nme.6005 – volume-title: Constrained optimization and Lagrange multiplier methods year: 1982 ident: 2396_CR5 – volume: 45 start-page: 3660 issue: 13 year: 2008 ident: 2396_CR9 publication-title: Int J Solids Struct doi: 10.1016/j.ijsolstr.2007.08.027 – volume: 17 start-page: 127 issue: 1–4 year: 2000 ident: 2396_CR7 publication-title: J Glob Optim doi: 10.1023/A:1026537630859 – ident: 2396_CR8 – volume: 71 start-page: 197 issue: 2 year: 1988 ident: 2396_CR3 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/0045-7825(88)90086-2 – volume: 69 start-page: 635 year: 1999 ident: 2396_CR4 publication-title: Arch Appl Mech doi: 10.1007/s004190050248 – volume: 43 start-page: 1 issue: 1 year: 2010 ident: 2396_CR1 publication-title: Structural and Multidisciplinary Optimization doi: 10.1007/s00158-010-0594-7 – volume: 58 start-page: 831 year: 2018 ident: 2396_CR24 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-018-1904-8 – volume: 139 start-page: 49 year: 2018 ident: 2396_CR19 publication-title: Finite Elem Anal Des doi: 10.1016/j.finel.2017.10.006 – volume: 48 start-page: 1031 issue: 6 year: 2013 ident: 2396_CR18 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-013-0978-6 – volume: 21 start-page: 120 issue: 2 year: 2001 ident: 2396_CR16 publication-title: Structural and Multidisciplinary Optimization doi: 10.1007/s001580050176 – volume: 15 start-page: 1031 year: 1998 ident: 2396_CR15 publication-title: Eng Comput doi: 10.1108/02644409810244129 – volume: 24 start-page: 359 issue: 2 year: 1987 ident: 2396_CR22 publication-title: Int J Numer Meth Eng doi: 10.1002/nme.1620240207 – volume: 28 start-page: 707 issue: 6 year: 2007 ident: 2396_CR12 publication-title: Appl Math Mech doi: 10.1007/s10483-007-0601-z – volume: 67 start-page: 1670 year: 2006 ident: 2396_CR23 publication-title: Int J Numer Methods Eng doi: 10.1002/nme.1677 – volume: 49 start-page: 885 year: 1993 ident: 2396_CR25 publication-title: Comput Struct doi: 10.1016/0045-7949(93)90035-C – volume: 92 start-page: 1026 issue: 12 year: 2012 ident: 2396_CR6 publication-title: International Journal for Numerical Methods in Engineering doi: 10.1002/nme.4367 – volume: 21 start-page: 80 issue: 1 year: 2001 ident: 2396_CR26 publication-title: Struct Multidiscip Optim doi: 10.1007/s001580050170 – volume: 41 start-page: 525 issue: 4 year: 2010 ident: 2396_CR14 publication-title: Struct Multidiscip Optim doi: 10.1007/s00158-009-0443-8 – volume: 17 start-page: 14 year: 1999 ident: 2396_CR2 publication-title: Struct Optim doi: 10.1007/BF01197709
SSID	ssj0008049
Score	2.4912353
Snippet	This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm....
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	411
SubjectTerms	Algorithms Computational Mathematics and Numerical Analysis Continuity (mathematics) Educational Paper Engineering Engineering Design Integer programming Integers Matlab Optimization Sensitivity Theoretical and Applied Mechanics Topology optimization
SummonAdditionalLinks	– databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI5gcIADb8RgoBy4QcT6Tk5oTEwcYEJiSLtVaZvCpK0bWzfBf-BHY6fpBkjswrlxFMmu89nxZxNybqUYcEWccaTnugrMOLKwyFEC-AgirnxVDJsI2m3e7YpHk3CbmLLK0idqR50MY8yRX9mO6zgeRAf169Ebw6lR-LpqRmiskjXskmDp0r2nuSfmBfxFUMMsN-ga0oymziFYwDIuwZDe6TPn58W0QJu_Hkj1vdPa_u-Jd8iWQZy0UZjILllR2R7Z_NaHcJ98tqZjBIJULWxiQocZzYsRCh90CJ5lYCibdNaTtCjBBvfQp7rjBAibUq8BbEllltCmzIaadUmRMPNeyMr-C5wxfx3oJXBtMcS59KHRuW_cUCTYH5Dn1m2necfMmAYWO9zLmYugRUg7gdBDyHriq4QHIkowxQpgRdat1It8aQe-SOMoFl4KoIjHPAZoUrci2zkkFTiPOiIUYqlEisi3UiVcVwXS9hxbpQArOAiqpEqsUkdhbHqY4yiNfjjvvqz1GoJeQ63X0KmSi7nMqOjgsXR1rVRmaP7mSbjQZJVcluaw-Pz3bsfLdzshGzaG7zqjUyOVfDxVp2Q9nuW9yfhM2_IXBv_5yg priority: 102 providerName: ProQuest
Title	Further elaborations on topology optimization via sequential integer programming and Canonical relaxation algorithm and 128-line MATLAB code
URI	https://link.springer.com/article/10.1007/s00158-019-02396-3 https://www.proquest.com/docview/2343358990
Volume	61
WOSCitedRecordID	wos000511324900024&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: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1615-1488 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0008049 issn: 1615-147X databaseCode: M7S dateStart: 19970201 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1615-1488 dateEnd: 20241209 omitProxy: false ssIdentifier: ssj0008049 issn: 1615-147X databaseCode: BENPR dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink Journals customDbUrl: eissn: 1615-1488 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008049 issn: 1615-147X databaseCode: RSV dateStart: 20000301 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/eLvHCXMwnV1LT8MwDLZgcIADb8RgTDlwg0rrOzlu0yYOME0boN2qtE1h0h5oKwj-Az8aO203QIAE58ZRGqf258afDXBmJhRwhdzgRM91FB7j0KQkR4ngww-58lTWbMLvdPhgILo5KWxeZLsXV5LaUi_IbuTeKfFKGETI9Ax7FdbQ3XFq2NDr3y3sL89AL0EZw3T8QU6V-X6Oz-5oiTG_XItqb9Pe_t86d2ArR5esnh2HXVhRkz3Y_FBzcB_e2k8zAn1MLfU_Z9MJS7N2Ca9silZknNMz2fNQsizdGk3BiOnqEiicp3WNcUomJzFryslUMywZkWNeMlk5up_OhunDWA9BF2UQpmXX9ZureoMRmf4Abtutm-alkbdkMCKbu6nhEEAR0ooxzBCyFnsq5r4IY_qdisBE1szEDT1p-Z5IojASboIAiEc8QhhSM0PLPoQSrkcdAcO4KZYi9MxECcdRvrRc21IJQgiOgioug1loJojyeuXUNmMULCot650OcKcDvdOBXYbzhcxjVq3j19GVQuFB_uXOA8t2bBtfTtTKcFEoePn459mO_zb8BDYsCt3135wKlNLZkzqF9eg5Hc5nVVhrtDrdXpVSUftVfb7fAdDi8k8
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9tAEB4hWgl66AsQKRT20J7Kinj92j0glAIRiBBVairlZtb2GpDyoIlJyX_gt_AbO7O2k4IENw49e2dlrb-d-WY8D4AvTkYOVyy5pPJczyCMY4eSHDWSjzCWJjDFsImw3ZbdrvqxAPdVLQylVVY60SrqdJhQjHxXuJ7r-ugd1Pevf3OaGkV_V6sRGgUsTs30D7ps472TQ_y-X4VoHnUOjnk5VYAnrvRz7pGNVVqkyJSVrqeBSWWo4pQigmhbdd3J_DjQIgxUlsSJ8jO04TKRCVrSuhNTowNU-a-QRghlUwV_zjS_LOg2kSjueGG3LNKxpXpETihtTHEqJw24-9AQztntox-y1s413_1vJ_Qe3paMmjWKK_ABFszgI7z5p8_iCtw1b0ZEdJmZY37MhgOWFyMipmyImrNflqSyyZVmRYo5qr8esx01ULhMZevjlkwPUnagB0NbVcqoIOi2kNW9CzyT_LJvl6BZ5sTj2Vmj02p8Z9RAYBV-vchxrMEivo9ZB4a-YqpVHDiZUZ5nQi18V5gMaZNEQZPWwKkwESVlj3YaFdKLZt2lLY4ixFFkcRS5Nfg2k7kuOpQ8u3qzAk9UaqtxNEdODXYq-M0fP73bp-d324al485ZK2qdtE83YFlQqMJGrzZhMR_dmM_wOpnkV-PRlr1HDM5fGpZ_ASXlVPM
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4CcGBN2IwIAduULE-1ibHMZhAjGkSA-1WpW0Kk7YObQXBf-BHY6fdAwRIiHPjKE2c-HPizwY4MmNyuAJucKLnOgrVODApyFEi-PACrlyVFZvwGg3ebovmFItfR7uPniQzTgNlaUrS06coPh0T38jUUxCWMIic6Rr2LMw7FEhP_vrt_fgs5hkAJlhjmI7Xzmkz3_fx2TRN8OaXJ1JteWqr_x_zGqzkqJNVMjVZhxmVbMDyVC7CTXivPQ8IDDI10Ysh6ycszcoovLE-ni69nLbJXjqSZWHYeER0mc46gcJ5uFcPu2QyiVhVJn3NvGREmnnNZGX3oT_opI893QRNl0FYl91UWvXKGSOS_Rbc1S5a1UsjL9VghDYvp4ZDwEVIK0L3Q8hS5KqIeyKI6JoVAYssmXE5cKXluSIOg1CUYwRGPOQhwpOSGVj2NszheNQOMPSnIikC14yVcBzlSatsWypGaMFRUEUFMEer5Id5HnMqp9H1xxmY9Uz7ONO-nmnfLsDxWOYpy-Lxa-viaPH9fEcPfct2bBt_TpQKcDJa7Mnnn3vb_VvzQ1hsntf8-lXjeg-WLPLu9YVPEebSwbPah4XwJe0MBwda0T8AK6D7hQ
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=Further+elaborations+on+topology+optimization+via+sequential+integer+programming+and+Canonical+relaxation+algorithm+and+128-line+MATLAB+code&rft.jtitle=Structural+and+multidisciplinary+optimization&rft.au=Liang%2C+Yuan&rft.au=Cheng%2C+Gengdong&rft.date=2020-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1615-147X&rft.eissn=1615-1488&rft.volume=61&rft.issue=1&rft.spage=411&rft.epage=431&rft_id=info:doi/10.1007%2Fs00158-019-02396-3&rft.externalDocID=10_1007_s00158_019_02396_3
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1615-147X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1615-147X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1615-147X&client=summon