An improved linearization technique for a class of quadratic 0-1 programming problems
The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint bounds. In this paper, we propose a computational enhancement for a linearization technique to make the linearized model much faster to solve....
Uložené v:
| Vydané v: | Optimization letters Ročník 6; číslo 1; s. 31 - 41 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Berlin/Heidelberg
Springer-Verlag
01.01.2012
|
| Predmet: | |
| ISSN: | 1862-4472, 1862-4480 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint bounds. In this paper, we propose a computational enhancement for a linearization technique to make the linearized model much faster to solve. We investigate the computational performance of the proposed approach, by comparing it with other linearization techniques on a class of 0-1 quadratic programming problems. We can further speed up the proposed technique by heuristically tightening the constraint bounds, as demonstrated by solving the uncapacitated single allocation
p
-hub median problem using the Civil Aeronautics Board data. |
|---|---|
| AbstractList | The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint bounds. In this paper, we propose a computational enhancement for a linearization technique to make the linearized model much faster to solve. We investigate the computational performance of the proposed approach, by comparing it with other linearization techniques on a class of 0-1 quadratic programming problems. We can further speed up the proposed technique by heuristically tightening the constraint bounds, as demonstrated by solving the uncapacitated single allocation
p
-hub median problem using the Civil Aeronautics Board data. |
| Author | Liu, Henry X. Chen, Anthony Chaovalitwongse, Wanpracha A. He, Xiaozheng |
| Author_xml | – sequence: 1 givenname: Xiaozheng surname: He fullname: He, Xiaozheng organization: Department of Civil Engineering, University of Minnesota – sequence: 2 givenname: Anthony surname: Chen fullname: Chen, Anthony organization: Department of Civil Engineering, Utah State University – sequence: 3 givenname: Wanpracha A. surname: Chaovalitwongse fullname: Chaovalitwongse, Wanpracha A. email: wchaoval@rci.rutgers.edu organization: Department of Industrial and Systems Engineering, Rutgers University – sequence: 4 givenname: Henry X. surname: Liu fullname: Liu, Henry X. organization: Department of Civil Engineering, University of Minnesota |
| BookMark | eNp9kM9OwzAMhyM0JLbBA3DLCxTstE3b4zTxT5rEhZ0jJ01Hpjbdkg6JPT0dQxw4cLDsw--z7G_GJr73lrFbhDsEKO4jYl5BAjiWyKrkeMGmWEqRZFkJk9-5EFdsFuMWQCJW1ZStF567bhf6D1vz1nlLwR1pcL3ngzXv3u0Pljd94MRNSzHyvuH7A9VhzBgOCfKR3QTqOuc3p1m3tovX7LKhNtqbnz5n68eHt-Vzsnp9elkuVokRZTkkSNpgiVrKupFQZbXOILUNITQ5VCa3VMgSCTSgFsJI0NZWkqRJSaRa5-mcFee9JvQxBtso44bv64dArlUI6mRHne2o0Y462VHHkcQ_5C64jsLnv4w4M3HM-o0Natsfgh8f_Af6Al-6eys |
| CitedBy_id | crossref_primary_10_1007_s11075_021_01075_z crossref_primary_10_1016_j_orl_2016_09_002 crossref_primary_10_1111_itor_12096 crossref_primary_10_1016_j_asoc_2019_105561 crossref_primary_10_1016_j_eswa_2022_116899 crossref_primary_10_1016_j_neucom_2016_12_064 crossref_primary_10_1109_JSYST_2018_2866465 crossref_primary_10_1016_j_trb_2015_02_006 crossref_primary_10_1016_j_measurement_2015_07_013 |
| Cites_doi | 10.1287/mnsc.32.10.1274 10.1016/S0966-8349(96)00011-3 10.1287/mnsc.22.4.455 10.1145/103147.103156 10.1016/j.trb.2005.11.003 10.1016/j.orl.2004.05.001 10.1016/j.disopt.2004.03.006 10.1016/S0377-2217(87)80007-3 10.1016/j.orl.2004.03.005 10.1287/opre.21.1.156 10.1016/0377-2217(94)90318-2 10.1287/opre.15.6.1171 10.1023/A:1019236832495 10.1016/0377-2217(78)90095-4 10.1111/1467-9787.00134 10.1007/s11590-006-0019-0 10.1016/0377-2217(95)00100-X 10.1287/opre.22.1.180 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag 2010 |
| Copyright_xml | – notice: Springer-Verlag 2010 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-010-0249-z |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 41 |
| ExternalDocumentID | 10_1007_s11590_010_0249_z |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYJHY B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LLZTM M4Y MA- N9A NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9M PF0 PT4 QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7Y Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c288t-1abc181b66df6094db403efa10f509c5ea7681a0b01b22c60bee96a6c3a23bb53 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000298646600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1862-4472 |
| IngestDate | Sat Nov 29 02:44:05 EST 2025 Tue Nov 18 21:23:44 EST 2025 Fri Feb 21 02:42:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Linearization technique Binary quadratic programming problem Hub location problem |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c288t-1abc181b66df6094db403efa10f509c5ea7681a0b01b22c60bee96a6c3a23bb53 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11590_010_0249_z crossref_primary_10_1007_s11590_010_0249_z springer_journals_10_1007_s11590_010_0249_z |
| PublicationCentury | 2000 |
| PublicationDate | 20120100 2012-1-00 |
| PublicationDateYYYYMMDD | 2012-01-01 |
| PublicationDate_xml | – month: 1 year: 2012 text: 20120100 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2012 |
| Publisher | Springer-Verlag |
| Publisher_xml | – name: Springer-Verlag |
| References | Glover, Woolsey (CR11) 1973; 21 Adams, Forrester (CR1) 2005; 33 Zangwill (CR20) 1965; 5 Elloumi, Faye, Soutif (CR8) 2000; 99 Adams, Sherali (CR3) 1986; 32 Skorin-Kapov, Skorin-Kapov, O’Kelly (CR18) 1996; 94 Campbell, Ernst, Krishnamoorthy, Hamacher, Drezner (CR6) 2001 Chaovalitwongse, Pardalos, Prokoyev (CR7) 2004; 32 Campbell (CR5) 1994; 72 Glover (CR10) 1975; 22 Adams, Forrester, Glover (CR2) 2004; 1 CR12 Ernst, Krishnamoorthy (CR9) 1996; 4 Bryan, O’Kelly (CR4) 1999; 39 Pardalos (CR15) 1991; 17 Watters (CR19) 1967; 15 Kaufman, Broeckx (CR13) 1978; 2 Sherali, Desai, Rakha (CR16) 2006; 40 O’Kelly (CR14) 1987; 32 Sherali, Smith (CR17) 2007; 1 J.F. Campbell (249_CR5) 1994; 72 249_CR12 J.F. Campbell (249_CR6) 2001 W.P. Adams (249_CR1) 2005; 33 D. Skorin-Kapov (249_CR18) 1996; 94 W.I. Zangwill (249_CR20) 1965; 5 S. Elloumi (249_CR8) 2000; 99 H.D. Sherali (249_CR17) 2007; 1 L. Kaufman (249_CR13) 1978; 2 W. Chaovalitwongse (249_CR7) 2004; 32 M. O’Kelly (249_CR14) 1987; 32 H.D. Sherali (249_CR16) 2006; 40 D.L. Bryan (249_CR4) 1999; 39 F. Glover (249_CR11) 1973; 21 P.M. Pardalos (249_CR15) 1991; 17 L. Watters (249_CR19) 1967; 15 W.P. Adams (249_CR3) 1986; 32 W.P. Adams (249_CR2) 2004; 1 A.T. Ernst (249_CR9) 1996; 4 F. Glover (249_CR10) 1975; 22 |
| References_xml | – start-page: 373 year: 2001 end-page: 406 ident: CR6 article-title: Hub location problems publication-title: Location theory: applications and theory – volume: 32 start-page: 1274 year: 1986 end-page: 1290 ident: CR3 article-title: A tight linearization and an algorithm for zero-one quadratic programming problems publication-title: Manag. Sci. doi: 10.1287/mnsc.32.10.1274 – volume: 4 start-page: 139 year: 1996 end-page: 154 ident: CR9 article-title: Efficient algorithms for the uncapacitated single allocation -hub median problem publication-title: Locat. Sci. doi: 10.1016/S0966-8349(96)00011-3 – volume: 22 start-page: 455 year: 1975 end-page: 460 ident: CR10 article-title: Improved linear integer programming formulations of nonlinear integer programs publication-title: Manag. Sci. doi: 10.1287/mnsc.22.4.455 – volume: 17 start-page: 74 year: 1991 end-page: 87 ident: CR15 article-title: Construction of test problems in quadratic bivalent programming publication-title: ACM Trans. Math. Softw. doi: 10.1145/103147.103156 – volume: 40 start-page: 857 year: 2006 end-page: 871 ident: CR16 article-title: A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2005.11.003 – ident: CR12 – volume: 33 start-page: 55 year: 2005 end-page: 61 ident: CR1 article-title: A simple recipe for concise mixed 0-1 linearizations publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.05.001 – volume: 1 start-page: 99 year: 2004 end-page: 120 ident: CR2 article-title: Comparison and enhancement strategies for linearizing mixed 0-1 quadratic programs publication-title: Discrete Optim. doi: 10.1016/j.disopt.2004.03.006 – volume: 32 start-page: 393 year: 1987 end-page: 404 ident: CR14 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(87)80007-3 – volume: 32 start-page: 517 year: 2004 end-page: 522 ident: CR7 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: 5 start-page: 30 year: 1965 end-page: 36 ident: CR20 article-title: Media selection by decision programming publication-title: J. Advert. Res. – volume: 21 start-page: 156 year: 1973 end-page: 161 ident: CR11 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: 72 start-page: 387 year: 1994 end-page: 405 ident: CR5 article-title: Integer programming formulations of discrete hub location problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(94)90318-2 – volume: 15 start-page: 1171 year: 1967 end-page: 1174 ident: CR19 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: 99 start-page: 79 year: 2000 end-page: 93 ident: CR8 article-title: Decomposition and linearization for 0-1 quadratic programming publication-title: Ann. Oper. Res. doi: 10.1023/A:1019236832495 – volume: 2 start-page: 204 year: 1978 end-page: 211 ident: CR13 article-title: An algorithm for the quadratic assignmnet problem using benders’ decomposition publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(78)90095-4 – volume: 39 start-page: 275 year: 1999 end-page: 295 ident: CR4 article-title: Hub-and-spoke network in air transportation: an analytical review publication-title: J. Reg. Sci. doi: 10.1111/1467-9787.00134 – volume: 1 start-page: 33 year: 2007 end-page: 47 ident: CR17 article-title: An improved linearization strategy for zero-one quadratic programming problems publication-title: Optim. Lett. doi: 10.1007/s11590-006-0019-0 – volume: 94 start-page: 582 year: 1996 end-page: 593 ident: CR18 article-title: Tight linear programming relaxations of uncapacitated -hub median problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00100-X – volume: 33 start-page: 55 year: 2005 ident: 249_CR1 publication-title: Operations Research Letters doi: 10.1016/j.orl.2004.05.001 – volume: 99 start-page: 79 year: 2000 ident: 249_CR8 publication-title: Ann. Oper. Res. doi: 10.1023/A:1019236832495 – volume: 1 start-page: 33 year: 2007 ident: 249_CR17 publication-title: Optim. Lett. doi: 10.1007/s11590-006-0019-0 – volume: 22 start-page: 455 year: 1975 ident: 249_CR10 publication-title: Manag. Sci. doi: 10.1287/mnsc.22.4.455 – volume: 32 start-page: 1274 year: 1986 ident: 249_CR3 publication-title: Manag. Sci. doi: 10.1287/mnsc.32.10.1274 – volume: 32 start-page: 517 year: 2004 ident: 249_CR7 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2004.03.005 – volume: 15 start-page: 1171 year: 1967 ident: 249_CR19 publication-title: Oper. Res. doi: 10.1287/opre.15.6.1171 – volume: 2 start-page: 204 year: 1978 ident: 249_CR13 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(78)90095-4 – volume: 32 start-page: 393 year: 1987 ident: 249_CR14 publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(87)80007-3 – volume: 72 start-page: 387 year: 1994 ident: 249_CR5 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(94)90318-2 – volume: 40 start-page: 857 year: 2006 ident: 249_CR16 publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2005.11.003 – volume: 17 start-page: 74 year: 1991 ident: 249_CR15 publication-title: ACM Trans. Math. Softw. doi: 10.1145/103147.103156 – volume: 5 start-page: 30 year: 1965 ident: 249_CR20 publication-title: J. Advert. Res. – volume: 94 start-page: 582 year: 1996 ident: 249_CR18 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00100-X – volume: 4 start-page: 139 year: 1996 ident: 249_CR9 publication-title: Locat. Sci. doi: 10.1016/S0966-8349(96)00011-3 – volume: 21 start-page: 156 year: 1973 ident: 249_CR11 publication-title: Oper. Res. doi: 10.1287/opre.21.1.156 – start-page: 373 volume-title: Location theory: applications and theory year: 2001 ident: 249_CR6 – ident: 249_CR12 doi: 10.1287/opre.22.1.180 – volume: 39 start-page: 275 year: 1999 ident: 249_CR4 publication-title: J. Reg. Sci. doi: 10.1111/1467-9787.00134 – volume: 1 start-page: 99 year: 2004 ident: 249_CR2 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2004.03.006 |
| SSID | ssj0061199 |
| Score | 1.9375938 |
| Snippet | The recent research on linearization techniques for solving 0-1 quadratic programming problems focuses on providing concise models and tightening constraint... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 31 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | An improved linearization technique for a class of quadratic 0-1 programming problems |
| URI | https://link.springer.com/article/10.1007/s11590-010-0249-z |
| Volume | 6 |
| WOSCitedRecordID | wos000298646600004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1862-4480 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0061199 issn: 1862-4472 databaseCode: RSV dateStart: 20070101 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/eLvHCXMwnV1LSwMxEB60etCDb7G-yMGTEthNdrPpsYjFi0XUSm9Lkk2goK12Ww_99U720VpQQQ97WJgNy2SSb94DcGEYV1zKiDoWaxopziniuKGch9ZZhRgYl8Mmkm5X9vut-6qOO6-z3euQZHFTL4rdEHl9EhU-aDPQ2SqsIdpJfxofHp_r61eE5dDIUPpyoChhdSjzuyWWwWg5EloATGf7X7-2A1uVPknapQDswood7sHmly6D-HY3b82a70OvPSSDwpNgM-J1TDSWy1JMMu_nSlCTJYoYr1mTkSPvU5V5STEkoCGpUrpecXFSzaPJD6DXuXm6vqXVbAVqmJQTGiptENy1EJkTaOJlOgq4dSoMHDLVxFahHRIq7ybVjBkRaGtbQgnDFeNax_wQGsPR0B4BEcJK4YJIJzyLgsxpmXAbO40Gr02SxDQhqJmcmqrxuJ9_8ZIuWiZ7_qXIv9TzL5014XL-yVvZdeM34qt6V9LqAOY_Ux__ifoENlBDYqXP5RQak_HUnsG6-ZgM8vF5IXifQBfTTQ |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA86BfXBb3F-5sEnJdAmbZo9DnEobkN0k72VJE1goJuumw_76730Y3Oggj70oXAN5XrN7y539zuELjRlkgkREEtDRQLJGAEc14Qx31gjAQPDfNhE1G6LXq_2UPRxp2W1e5mSzHbqebMbIK8rooILYgYyXUYrAQCWq-N7fHout1_u50MjfeHagYKIlqnM75ZYBKPFTGgGMI2tf73aNtos_Elczw1gBy2ZwS7a-MIyCHetGTVruoe69QHuZycJJsHOx4RgOW_FxDM-VwyeLJZYO88aDy1-n8jEWYrGHvFxUdL1CovjYh5Nuo-6jZvO9S0pZisQTYUYE18qDeCuOE8shxAvUYHHjJW-Z8GF0KGREIf40h2TKko195QxNS65ZpIypUJ2gCqD4cAcIsy5Edx6gYpYEniJVSJiJrQKAl4TRZGuIq9UcqwL4nE3_-IlnlMmO_3FoL_Y6S-eVtHl7JG3nHXjN-Gr8qvExQ-Y_ix99Cfpc7R222k14-Zd-_4YrYO3RPPzlxNUGY8m5hSt6o9xPx2dZUb4CTGU1jE |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD3-L8zINPSrBN2jR7HOpQ1DHQyd5KkiYw0G6umw_7603WdnOggvjQh8I1lMu1d5e7-_0AzhShgnIeYENCiQNBKbZ-XGFKfW20sD4wzMkmomaTdzq1VsFzmpXd7mVJMp9pcChN6fCyn5jL2eCb9cKuocpeNn_A40VYChxnkEvXn17KXzHzcwJJn7vRoCAiZVnzuyXmHdN8VXTibBob_37NTVgv4kxUzw1jCxZ0ug1rX9AH7d3jFLI124F2PUXdyQmDTpCLPW0SnY9ooinOK7IRLhJIuYgb9Qx6H4nEWZBCHvZR0er1ZhdHBU9Ntgvtxs3z1S0uOBewIpwPsS-ksk5fMpYYZlO_RAYe1Ub4nrGhhQq1sPmJL9zxqSREMU9qXWOCKSoIlTKke1BJe6neB8SY5sx4gYxoEniJkTyiOjTSJsI6iiJVBa9UeKwKQHLHi_Eaz6CUnf5iq7_Y6S8eV-F8-kg_R-P4Tfii3KG4-DCzn6UP_iR9Ciut60b8cNe8P4RVG0SR_FjmCCrDwUgfw7L6GHazwcnEHj8Bam_fFQ |
| 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=An+improved+linearization+technique+for+a+class+of+quadratic+0-1+programming+problems&rft.jtitle=Optimization+letters&rft.au=He%2C+Xiaozheng&rft.au=Chen%2C+Anthony&rft.au=Chaovalitwongse%2C+Wanpracha+A.&rft.au=Liu%2C+Henry+X.&rft.date=2012-01-01&rft.pub=Springer-Verlag&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=6&rft.issue=1&rft.spage=31&rft.epage=41&rft_id=info:doi/10.1007%2Fs11590-010-0249-z&rft.externalDocID=10_1007_s11590_010_0249_z |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon |