{"id":"https://openalex.org/W2885990794","doi":"https://doi.org/10.2312/vmv.20171267","title":"Efficient Lifted Relaxations of the Quadratic Assignment Problem","display_name":"Efficient Lifted Relaxations of the Quadratic Assignment Problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2885990794","doi":"https://doi.org/10.2312/vmv.20171267","mag":"2885990794"},"language":"en","primary_location":{"id":"doi:10.2312/vmv.20171267","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vmv.20171267","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/vmv.20171267","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042998972","display_name":"Oliver Burghard","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Burghard, Oliver","raw_affiliation_strings":["University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037976392","display_name":"Reinhard Klein","orcid":"https://orcid.org/0000-0002-5505-9347"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klein, Reinhard","raw_affiliation_strings":["University of Bonn, Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042998972"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9660000205039978,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9448000192642212,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5853897929191589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5338258743286133},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4765803813934326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3101928234100342},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07308089733123779}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5853897929191589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5338258743286133},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4765803813934326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3101928234100342},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07308089733123779}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2312/vmv.20171267","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vmv.20171267","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2885990794","is_oa":false,"landing_page_url":"https://diglib.eg.org/handle/10.2312/vmv20171267","pdf_url":null,"source":{"id":"https://openalex.org/S4306421152","display_name":"Vision Modeling and Visualization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Vision Modeling and Visualization","raw_type":null}],"best_oa_location":{"id":"doi:10.2312/vmv.20171267","is_oa":true,"landing_page_url":"https://doi.org/10.2312/vmv.20171267","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2407060857","https://openalex.org/W2099299422","https://openalex.org/W2912522929","https://openalex.org/W2162244456","https://openalex.org/W2012204533","https://openalex.org/W175821119","https://openalex.org/W2086659547","https://openalex.org/W1878408459","https://openalex.org/W1979596467","https://openalex.org/W3150415986","https://openalex.org/W2760380185","https://openalex.org/W95927789","https://openalex.org/W2122983719","https://openalex.org/W2569119799","https://openalex.org/W3105031806","https://openalex.org/W164225028","https://openalex.org/W1982131534","https://openalex.org/W2090967418","https://openalex.org/W2784166150","https://openalex.org/W2007157764"],"abstract_inverted_index":{"Quadratic":[0],"assignment":[1,6],"problems":[2,89],"(QAPs)":[3],"and":[4,18,23,51,71,161],"quadratic":[5],"matchings":[7],"(QAMs)":[8],"recently":[9,46,178],"gained":[10],"a":[11,61,77,101],"lot":[12],"of":[13,34,85,100,110,131,143,240,251],"interest":[14],"in":[15,38,48,56,158,194,237],"computer":[16,49,159],"graphics":[17,50,160],"vision,":[19],"e.g.":[20],"for":[21,126,182,223],"shape":[22,87,199],"graph":[24],"matching.":[25],"Literature":[26],"describes":[27],"several":[28,252],"convex":[29,44],"relaxations":[30,45,155,166,191,203],"to":[31,53,123,174,221,245],"approximate":[32],"solutions":[33],"the":[35,43,86,98,108,116,129,132,140,154,164,177,198,205,210,232,238],"NP-hard":[36],"QAPs":[37,241],"polynomial":[39],"time.":[40],"We":[41],"compare":[42],"introduced":[47,179],"vision":[52],"established":[54],"approaches":[55],"discrete":[57],"optimization.":[58],"Building":[59],"upon":[60],"unified":[62],"constraint":[63],"formulation":[64],"we":[65,225,242],"theoretically":[66],"analyze":[67],"their":[68,72],"solution":[69],"spaces":[70],"approximation":[73,180],"quality.":[74],"Experiments":[75],"on":[76,83],"standard":[78],"benchmark":[79],"as":[80,82,151,153,219],"well":[81,220],"instances":[84,128],"matching":[88,200],"support":[90],"our":[91],"analysis.":[92],"It":[93],"turns":[94],"out":[95],"that":[96,209],"often":[97,120,168],"bounds":[99,109,130],"tight":[102],"linear":[103,117,133,190,211],"relaxation":[104,118,134,142,212],"are":[105,135],"competitive":[106],"with":[107],"semidefinite":[111],"programming":[112],"(SDP)":[113],"relaxations,":[114],"while":[115],"is":[119,148,192],"much":[121],"faster":[122,193],"calculate.":[124],"Indeed,":[125],"many":[127],"only":[136,208],"slightly":[137],"worse":[138],"than":[139],"SDP":[141,165],"Zhao":[144],"[ZKRW98,PR09],":[145],"which":[146,224],"itself":[147],"at":[149],"least":[150],"accurate":[152],"currently":[156],"used":[157],"vision.":[162],"Solving":[163],"can":[167],"be":[169],"accelerated":[170],"considerably":[171],"from":[172],"hours":[173],"minutes":[175],"using":[176],"method":[181],"trace":[183],"bound":[184],"SDPs":[185],"[WSvdHT16],":[186],"but":[187],"nonetheless":[188],"calculating":[189],"most":[195],"cases.":[196],"For":[197],"problem":[201],"all":[202],"generate":[204],"optimal":[206],"solution,":[207],"does":[213],"so":[214],"faster.":[215],"Our":[216],"results":[217],"generalize":[218],"QAMs":[222],"deliver":[226],"new":[227],"relaxations.":[228],"Furthermore":[229],"by":[230],"interpreting":[231],"Product":[233],"Manifold":[234],"Filter":[235],"[VLR\u221717]":[236],"context":[239],"show":[243],"how":[244],"automatically":[246],"calculate":[247],"correspondences":[248],"between":[249],"shapes":[250],"hundred":[253],"points.":[254]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}