A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpens...
Gespeichert in:
| Veröffentlicht in: | Mathematics of operations research Jg. 34; H. 4; S. 1008 - 1022 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Linthicum
INFORMS
01.11.2009
Institute for Operations Research and the Management Sciences |
| Schlagworte: | |
| ISSN: | 0364-765X, 1526-5471 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation. We apply majorization to obtain a relaxation of the orthogonal similarity set of the quadratic part of the objective function. This exploits the matrix structure of QAP and results in a relaxation with much smaller dimension than other current SDP relaxations. We compare the resulting bounds with several other computationally inexpensive bounds such as the convex quadratic programming relaxation (QPB). We find that our method provides stronger bounds on average and is adaptable for branch-and-bound methods. |
|---|---|
| AbstractList | The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation. We apply majorization to obtain a relaxation of the orthogonal similarity set of the quadratic part of the objective function. This exploits the matrix structure of QAP and results in a relaxation with much smaller dimension than other current SDP relaxations. We compare the resulting bounds with several other computationally inexpensive bounds such as the convex quadratic programming relaxation (QPB). We find that our method provides stronger bounds on average and is adaptable for branch-and-bound methods. The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation. We apply majorization to obtain a relaxation of the orthogonal similarity set of the quadratic part of the objective function. This exploits the matrix structure of QAP and results in a relaxation with much smaller dimension than other current SDP relaxations. We compare the resulting bounds with several other computationally inexpensive bounds such as the convex quadratic programming relaxation (QPB). We find that our method provides stronger bounds on average and is adaptable for branch-and-bound methods. [PUBLICATION ABSTRACT] The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation. We apply majorization to obtain a relaxation of the orthogonal similarity set of the quadratic part of the objective function. This exploits the matrix structure of QAP and results in a relaxation with much smaller dimension than other current SDP relaxations. We compare the resulting bounds with several other computationally inexpensive bounds such as the convex quadratic programming relaxation (QPB). We find that our method provides stronger bounds on average and is adaptable for branch-and-bound methods. The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation. We apply majorization to obtain a relaxation of the orthogonal similarity set of the quadratic part of the objective function. This exploits the matrix structure of QAP and results in a relaxation with much smaller dimension than other current SDP relaxations. We compare the resulting bounds with several other computationally inexpensive bounds such as the convex quadratic programming relaxation (QPB). We find that our method provides stronger bounds on average and is adaptable for branch-and-bound methods. Key words: quadratic assignment problem; semidefinite programming relaxations; interior point methods; large-scale problems MSC2000 subject classification: Primary: 90C26, 90C22; secondary: 90C09, 65K10 OR/MS subject classification: Primary: Programming; secondary: quadratic History: Received October 27, 2006; revised April 22, 2008, June 2, 2009, and August 10, 2009. Published online in Articles in Advance October 20, 2009. DOI 10.1287/moor.1090.0419 |
| Audience | Academic |
| Author | Wolkowicz, Henry Ding, Yichuan |
| Author_xml | – sequence: 1 fullname: Ding, Yichuan – sequence: 2 fullname: Wolkowicz, Henry |
| BookMark | eNqFkd9r1TAYhoNM8Gx6651QvFKwx6RJ0_byMHUODv7YFLwLafulJ4e22ZKUzf9-X62ikyPSQiF5nvTL-x6To9GNQMhTRtcsK4vXg3N-zWhF11Sw6gFZsTyTaS4KdkRWlEuRFjL_9ogch7CnlOUFEyvyYZNs3U36xg4wButG3SeXMNgWjB1thOQCen2rI-4kxvkk7iD5POnW41KTbEKw3YhmTD55V_cwPCYPje4DPPn5PSFf3739cvo-3X48Oz_dbNMm52VMQRZZDdwwBkZTmrdlZoxhUhspalFRwdta8JKDKRsogBaCtoLW-GommKn4CXm-nHvl3fUEIaq9mzxOH1TGMikrWc1QukCd7kHZ0bjoddPBCF73mJ2xuLzJGJcVKwqB_PoAj0-LiTQHhZf3BGQi3MZOTyGo88uL--yrP9h6CnYEjA9D73YxLMqhWRrvQvBg1JW3g_bfFaNqrlvNdau5bjXXjYL4S2hs_FEcXsL2_9aeLdo-RNz49RNBsSfB2O8M5zj8EP4_xouF3-G9bqxfcpzFQccdolwogTwt-R20a9Zd |
| CODEN | MOREDQ |
| CitedBy_id | crossref_primary_10_1007_s11590_021_01708_1 crossref_primary_10_1137_090748834 crossref_primary_10_1109_TSP_2010_2053847 crossref_primary_10_1137_16M1075144 crossref_primary_10_1287_ijoc_1120_0542 crossref_primary_10_1137_140988796 crossref_primary_10_1137_23M1609622 crossref_primary_10_1145_2629672 crossref_primary_10_1287_moor_1100_0473 crossref_primary_10_1109_JBHI_2023_3250711 crossref_primary_10_1007_s10589_014_9663_y crossref_primary_10_1145_3130800_3130826 crossref_primary_10_1007_s10107_020_01564_4 crossref_primary_10_1137_23M1580905 crossref_primary_10_1109_TWC_2018_2828831 crossref_primary_10_1007_s12597_020_00475_4 |
| Cites_doi | 10.1007/978-1-4757-3155-2_7 10.1137/S1052623498336930 10.1287/moor.17.3.727 10.1007/978-1-4615-4381-7_13 10.1016/0024-3795(92)90338-B 10.1287/opre.46.6.912 10.1287/opre.16.1.150 10.1090/dimacs/016/10 10.1109/CWIT.2007.375719 10.1137/05064816X 10.1007/BF01585694 10.1007/BF01302894 10.1007/PL00011402 10.1007/s10107-003-0437-z 10.1007/s101070100255 10.1007/s006070050040 10.1023/A:1009795911987 10.1137/S0895479898340299 10.1090/dimacs/016 10.1287/mnsc.9.4.586 10.1137/S1052623494273393 10.1007/978-1-4615-4381-7_10 10.1007/s10107-006-0038-8 10.1137/0110022 10.1016/0377-2217(91)90197-4 10.1145/1410012.1410042 10.1007/BF01581147 10.1090/dimacs/016/01 10.1016/S0377-2217(97)00063-5 |
| ContentType | Journal Article |
| Copyright | Copyright 2009 Institute for Operations Research and the Management Sciences COPYRIGHT 2009 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences Nov 2009 |
| Copyright_xml | – notice: Copyright 2009 Institute for Operations Research and the Management Sciences – notice: COPYRIGHT 2009 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences Nov 2009 |
| DBID | AAYXX CITATION N95 ISR 3V. 7WY 7WZ 7XB 87Z 8AL 8AO 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 M0C M0N M2O M7S MBDVC P5Z P62 PADUT PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
| DOI | 10.1287/moor.1090.0419 |
| DatabaseName | CrossRef Gale Business: Insights Gale In Context: Science ProQuest Central (Corporate) ProQuest ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest Pharma Collection ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Research Library 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 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 ABI/INFORM Global Computing Database Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Research Library China ProQuest Central Premium ProQuest One Academic (New) 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 ABI/INFORM Collection China 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 SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Research Library China ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database 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 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 ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | CrossRef 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 Computer Science Business |
| EISSN | 1526-5471 |
| EndPage | 1022 |
| ExternalDocumentID | 1908608611 A213691774 10_1287_moor_1090_0419 40538411 moor.1090.0419 mathor_34_4_1008 |
| Genre | Research Article |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| GroupedDBID | 08R 29M 3V. 4.4 4S 5GY 7WY 85S 8AL 8AO 8FE 8FG 8FL 8G5 8VB AAKYL AAPBV ABBHK ABEFU ABFLS ABJCF ABPPZ ABUWG ACIWK ACNCT ADCOW ADGDI ADMHP ADODI AEILP AENEX AEUPB AFKRA AFXKK AKVCP ALMA_UNASSIGNED_HOLDINGS ARAPS ARCSS AZQEC BDTQF BENPR BEZIV BGLVJ BHOJU BKOMP BPHCQ CBXGM CHNMF CS3 CWXUR CZBKB DQDLB DSRWC DWQXO EBA EBE EBO EBR EBS EBU ECEWR ECR ECS EDO EFSUC EJD EMK EPL FEDTE FRNLG GIFXF GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HECYW HQ6 H~9 IAO ICW IEA IGG IOF ISR ITC JAA JBU JMS JPL JSODD JST K6 K60 K6V K7- L6V M0C M0N M2O M7S MBDVC MV1 N95 NIEAY P2P P62 PADUT PQEST PQQKQ PQUKI PRG PRINS PROAC PTHSS QWB RPU RXW SA0 TAE TH9 TN5 TUS U5U WH7 X XHC XI7 ZL0 ZY4 1AW 1OL 8H ACYGS AELPN BES F20 HGD HVGLF P-O RNS XFK Y99 -~X .DC 18M 2AX AAOAC AAWIL AAWTO ABAWQ ABDNZ ABFAN ABKVW ABQDR ABXSQ ABYRZ ABYWD ABYYQ ACDIW ACGFO ACHJO ACMTB ACTMH ACUHF ACVFL ACXJH ADULT AEGXH AELLO AEMOZ AFVYC AGLNM AHAJD AHQJS AIAGR AIHAF AKBRZ ALRMG AMVHM APTMU ASMEE BAAKF CCPQU IPSME JAAYA JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPPEU K1G K6~ PHGZM PHGZT PQBIZ PQBZA 8H~ AADHG AAYXX AFFHD CITATION PQGLB WHG XOL 7XB 8FK JQ2 L.- PKEHL Q9U |
| ID | FETCH-LOGICAL-c538t-e672be3f11efa005d82fff16af64b49043db4383ef8ce7e0740d40b40ba141f93 |
| IEDL.DBID | 7WY |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000271911100013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0364-765X |
| IngestDate | Sat Aug 23 12:52:31 EDT 2025 Sat Nov 29 12:47:40 EST 2025 Tue Nov 04 18:49:32 EST 2025 Thu Nov 13 14:56:12 EST 2025 Sat Nov 29 08:56:52 EST 2025 Sat Nov 29 03:29:23 EST 2025 Tue Nov 18 22:17:44 EST 2025 Thu Jun 19 15:26:15 EDT 2025 Wed Jan 06 02:47:59 EST 2021 Fri Jan 15 03:35:44 EST 2021 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c538t-e672be3f11efa005d82fff16af64b49043db4383ef8ce7e0740d40b40ba141f93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 212669699 |
| PQPubID | 37790 |
| PageCount | 15 |
| ParticipantIDs | gale_incontextgauss_ISR_A213691774 jstor_primary_40538411 crossref_primary_10_1287_moor_1090_0419 gale_infotracgeneralonefile_A213691774 highwire_informs_mathor_34_4_1008 proquest_journals_212669699 gale_businessinsightsgauss_A213691774 informs_primary_10_1287_moor_1090_0419 gale_infotracacademiconefile_A213691774 crossref_citationtrail_10_1287_moor_1090_0419 |
| ProviderPackageCode | Y99 RPU NIEAY |
| PublicationCentury | 2000 |
| PublicationDate | 2009-11-01 |
| PublicationDateYYYYMMDD | 2009-11-01 |
| PublicationDate_xml | – month: 11 year: 2009 text: 2009-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Linthicum |
| PublicationPlace_xml | – name: Linthicum |
| PublicationTitle | Mathematics of operations research |
| PublicationYear | 2009 |
| Publisher | INFORMS Institute for Operations Research and the Management Sciences |
| Publisher_xml | – name: INFORMS – name: Institute for Operations Research and the Management Sciences |
| References | B20 B21 B22 B23 B24 B25 B26 B27 B28 B29 B30 B31 B10 B32 B11 B33 B12 B34 B13 B35 B14 B36 B15 B16 B17 B18 B19 B1 B2 B3 B4 B5 B6 B7 B8 B9 Marshall A. W. (B23) 1979 Horn R. A. (B19) 1994 Hadley S. W. (B13) 1990 Finke G. (B11) 1987; 31 Hardy G. H. (B18) 1934 |
| References_xml | – ident: B12 – ident: B9 – ident: B35 – ident: B14 – ident: B10 – ident: B3 – ident: B20 – ident: B1 – ident: B27 – ident: B7 – ident: B5 – ident: B29 – ident: B25 – ident: B23 – ident: B21 – ident: B18 – ident: B16 – ident: B31 – ident: B33 – ident: B8 – ident: B36 – ident: B11 – ident: B13 – ident: B2 – ident: B26 – ident: B4 – ident: B28 – ident: B6 – ident: B24 – ident: B22 – ident: B17 – ident: B32 – ident: B15 – ident: B30 – ident: B34 – ident: B19 – ident: B34 doi: 10.1007/978-1-4757-3155-2_7 – ident: B6 doi: 10.1137/S1052623498336930 – ident: B14 doi: 10.1287/moor.17.3.727 – volume-title: Inequalities: Theory of Majorization and Its Applications year: 1979 ident: B23 – ident: B27 doi: 10.1007/978-1-4615-4381-7_13 – ident: B15 doi: 10.1016/0024-3795(92)90338-B – ident: B16 doi: 10.1287/opre.46.6.912 – ident: B28 doi: 10.1287/opre.16.1.150 – start-page: 237 volume-title: Integer Programming and Combinatorial Optimization year: 1990 ident: B13 – ident: B20 doi: 10.1090/dimacs/016/10 – ident: B25 doi: 10.1109/CWIT.2007.375719 – ident: B5 doi: 10.1137/05064816X – volume-title: Topics in Matrix Analysis (Corrected reprint of the 1991 original) year: 1994 ident: B19 – ident: B33 doi: 10.1007/BF01585694 – ident: B9 doi: 10.1007/BF01302894 – ident: B2 doi: 10.1007/PL00011402 – ident: B1 doi: 10.1007/s10107-003-0437-z – ident: B4 doi: 10.1007/s101070100255 – ident: B21 doi: 10.1007/s006070050040 – ident: B36 doi: 10.1023/A:1009795911987 – ident: B3 doi: 10.1137/S0895479898340299 – ident: B29 doi: 10.1090/dimacs/016 – ident: B22 doi: 10.1287/mnsc.9.4.586 – ident: B31 doi: 10.1137/S1052623494273393 – ident: B26 doi: 10.1007/978-1-4615-4381-7_10 – ident: B32 doi: 10.1007/s10107-006-0038-8 – ident: B12 doi: 10.1137/0110022 – ident: B7 doi: 10.1016/0377-2217(91)90197-4 – volume: 31 start-page: 61 year: 1987 ident: B11 publication-title: Ann. Discrete Math. – ident: B8 doi: 10.1145/1410012.1410042 – volume-title: Inequalities year: 1934 ident: B18 – ident: B10 doi: 10.1007/BF01581147 – ident: B30 doi: 10.1090/dimacs/016/01 – ident: B17 doi: 10.1016/S0377-2217(97)00063-5 |
| SSID | ssj0015714 |
| Score | 2.0026522 |
| Snippet | The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still... |
| SourceID | proquest gale crossref jstor informs highwire |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1008 |
| SubjectTerms | Analysis Assignment problem Branch & bound algorithms Comparative analysis Eigenvalues interior point methods Interior points large-scale problems Mathematical inequalities Mathematical permutation Mathematical theorems Mathematical vectors Matrices Objective functions quadratic assignment problem Quadratic programming Relaxation methods (Mathematics) semidefinite programming relaxations Studies |
| Title | A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem |
| URI | http://mor.journal.informs.org/cgi/content/abstract/34/4/1008 https://www.jstor.org/stable/40538411 https://www.proquest.com/docview/212669699 |
| Volume | 34 |
| WOSCitedRecordID | wos000271911100013&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: ABI/INFORM Collection customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: 7WY dateStart: 19990201 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: M0C dateStart: 19990201 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: P5Z dateStart: 19990201 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: K7- dateStart: 19990201 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: M7S dateStart: 19990201 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: BENPR dateStart: 19990201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Research Library customDbUrl: eissn: 1526-5471 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0015714 issn: 0364-765X databaseCode: M2O dateStart: 19990201 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwELdgQwgeGBQmymAKCLYns7hx4uQJlbEJBJSygii8WPFXqcSa0bTAn8-d41Sr-HpAqixVuUi53Pl8F59_P0IeZqYHC19SUitKKFCKwtC8FI5qlzFbKFWyWHuyCTEY5ONxMQy9OXVoq2xjog_UptL4jfwAQmyWFVlRPDn7SpE0CjdXA4PGRbIJ63SKBAbiw8fVJkIqWECP4lRk6ThgNkKNcHBaVXNEUoofxxxBds6tSW1kbuGC_TEnTCDrtmXxl7Dt16Ljrf_U4jq5FpLQqN94zQ1ywc465HLbA98hWy3XQxSmfodcPQdceJMM-tGr6jt9htQADaxHNLKnU2PdFHPYCFvsfnibR6BTBElm9HZZGvQ2HYFHTCe-CSEaNnQ2t8j746N3h89pYGagGgLkgtpM9JRNHGPWlTCPTd5zzrGsdBlXvIh5YhRioFqXaysspCmx4bGCX8k4c0WyTTZm1czeJpExOtVGmbhwnAu4XaksZ9wJVuTKqrxLaGsbqQNsObJnfJFYvoAtJdoSN9Jjibbskv2V_FkD2PFHyUdoahnYPmGo8XtIPSmXdS37PZZkUMsK3iUPvByiZcywHacReDE6WRPaD0KugsfTZTjdAEoiwNaa5N6a5KSBF_-d4P3WB2XwQAlVzGfQIeGSI9o0vJ299tK_lN32vrsSg0Q9yTljXbLTeqoM4auWKze989erO-SK31zzRzPvko3FfGnvkUv622Jaz3f9ZNwlm0-PBsMT-PdSUBhfx4c49t7gKEYwDtNPPwHwRkL0 |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF5VBfE4UAhUhPJYEG1Ppl57s7YPCEWUqlFCVGiRclu8rxCJxiVOKPwo_iMztjdqxOvUA1Lkiz9L2fU3Mzve2W8IeS5MBIEvzgOb5JCgZJkJ0jxxgXaC2UypnIW6ajaRDIfpaJQdrZEf_iwMllV6n1g5alNo_Ea-By5WiExk2auzLwE2jcLNVd9Bo2ZF334_h4ytfNnbh9e7HUUHb05eHwZNU4FAg23PAyuSSNnYMWZdDhQ0aeScYyJ3giuehTw2CuU7rUu1TSxE2NDwUMEvZ5w51F4Cj38FIAINqp8Ey02LTsIatSoeJKIzajQiISfZOy2KGSo3hS9CjqI-F2KgjwRenrg6VoUL1tKXSP4SJqrYd7Dxn83abXKrWWTTbm0Vd8ianbbINV_j3yIbvpcFbVxbi9y8IMx4lwy7dFCcB_vY-qCWLaHH9nRirJvgGp1iCeG3itMU5pDCIpq-W-QGrUlTYPxkXBVZ0KO6Xc898uFShrtJ1qfF1N4n1Bjd0UaZMHOcJ_C4UiJl3CUsS5VVaZsEngtSN7Ls2B3ks8T0DLgjkTtYKBBK5E6b7C7xZ7UgyR-R20gt2XQzhUuJ33vKcb4oS9mNWCwgV094mzyrcKgGMsVyoxrQO36_AtptQK6Av6fz5vQGDBIFxFaQOyvIcS2f_jvgU8952TBeQpb2CcYQc8lRTRtmZ8ff-tdgNytbWcIgEYlTzlibbHnLkI17LuXSLB789e4Tcv3w5O1ADnrD_ha5UW0kVsdQH5L1-WxhH5Gr-ut8Us4eV46Ako-XbUM_AVclmfM |
| 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+low-dimensional+semidefinite+relaxation+for+the+quadratic+assignment+problem&rft.jtitle=Mathematics+of+operations+research&rft.au=Ding%2C+Yichuan&rft.au=Wolkowicz%2C+Henry&rft.date=2009-11-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0364-765X&rft.volume=34&rft.issue=4&rft_id=info:doi/10.1287%2Fmoor.1090.0419&rft.externalDocID=A213691774 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0364-765X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0364-765X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0364-765X&client=summon |