{"id":"https://openalex.org/W2078879373","doi":"https://doi.org/10.1007/s13675-014-0033-4","title":"A linear formulation with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:msup> <mml:mi>n</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> </mml:math> variables for quadratic assignment problems with Manhattan distance matrices","display_name":"A linear formulation with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:msup> <mml:mi>n</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> </mml:math> variables for quadratic assignment problems with Manhattan distance matrices","publication_year":2014,"publication_date":"2014-11-21","ids":{"openalex":"https://openalex.org/W2078879373","doi":"https://doi.org/10.1007/s13675-014-0033-4","mag":"2078879373"},"language":"lv","primary_location":{"id":"doi:10.1007/s13675-014-0033-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-014-0033-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-014-0033-4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014362095","display_name":"Serigne Gu\u00e8ye","orcid":"https://orcid.org/0000-0001-7217-8543"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Serigne Gueye","raw_affiliation_strings":["Laboratoire d\u2019Informatique d\u2019Avignon (LIA), Universit\u00e9 d\u2019Avignon et des Pays du Vaucluse, 339, chemin des Meinajaries, Agroparc BP 91228, 84911, Avignon Cedex 9, France","Universite d'Avignon et des Pays du Vaucluse"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique d\u2019Avignon (LIA), Universit\u00e9 d\u2019Avignon et des Pays du Vaucluse, 339, chemin des Meinajaries, Agroparc BP 91228, 84911, Avignon Cedex 9, France","institution_ids":[]},{"raw_affiliation_string":"Universite d'Avignon et des Pays du Vaucluse","institution_ids":["https://openalex.org/I198415970"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016889937","display_name":"Philippe Michelon","orcid":"https://orcid.org/0000-0001-6648-5651"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Michelon","raw_affiliation_strings":["Laboratoire d\u2019Informatique d\u2019Avignon (LIA), Universit\u00e9 d\u2019Avignon et des Pays du Vaucluse, 339, chemin des Meinajaries, Agroparc BP 91228, 84911, Avignon Cedex 9, France","Universite d'Avignon et des Pays du Vaucluse"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique d\u2019Avignon (LIA), Universit\u00e9 d\u2019Avignon et des Pays du Vaucluse, 339, chemin des Meinajaries, Agroparc BP 91228, 84911, Avignon Cedex 9, France","institution_ids":[]},{"raw_affiliation_string":"Universite d'Avignon et des Pays du Vaucluse","institution_ids":["https://openalex.org/I198415970"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014362095"],"corresponding_institution_ids":["https://openalex.org/I198415970"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.189617,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"2","first_page":"79","last_page":"110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"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/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5794064402580261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.56691974401474},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5428436398506165},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5328821539878845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5234569907188416},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.4825103282928467},{"id":"https://openalex.org/keywords/distance-matrices-in-phylogeny","display_name":"Distance matrices in phylogeny","score":0.45161038637161255},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4510681629180908},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4237178862094879},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38834887742996216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33234596252441406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26104310154914856},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12780410051345825},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10637187957763672}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5794064402580261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56691974401474},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5428436398506165},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5328821539878845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5234569907188416},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.4825103282928467},{"id":"https://openalex.org/C5349765","wikidata":"https://www.wikidata.org/wiki/Q5282866","display_name":"Distance matrices in phylogeny","level":2,"score":0.45161038637161255},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4510681629180908},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4237178862094879},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38834887742996216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33234596252441406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26104310154914856},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12780410051345825},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10637187957763672},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s13675-014-0033-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-014-0033-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02455903v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02455903","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, 2015, 3 (2), pp.79-110. &#x27E8;10.1007/s13675-014-0033-4&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:7c02ee14063840faa708442c3aa2a222","is_oa":true,"landing_page_url":"https://doaj.org/article/7c02ee14063840faa708442c3aa2a222","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 3, Iss 2, Pp 79-110 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s13675-014-0033-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-014-0033-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1492333772","https://openalex.org/W1503085769","https://openalex.org/W1595903022","https://openalex.org/W1952162104","https://openalex.org/W1965651580","https://openalex.org/W1966081460","https://openalex.org/W1968143987","https://openalex.org/W1969909704","https://openalex.org/W1971700807","https://openalex.org/W1986591158","https://openalex.org/W1996043196","https://openalex.org/W2007218093","https://openalex.org/W2007572995","https://openalex.org/W2016688797","https://openalex.org/W2020696014","https://openalex.org/W2028920274","https://openalex.org/W2029983132","https://openalex.org/W2032508248","https://openalex.org/W2034432217","https://openalex.org/W2038964118","https://openalex.org/W2041818766","https://openalex.org/W2049299385","https://openalex.org/W2049628958","https://openalex.org/W2061796216","https://openalex.org/W2066883591","https://openalex.org/W2070496218","https://openalex.org/W2082215293","https://openalex.org/W2084512390","https://openalex.org/W2096684255","https://openalex.org/W2098945517","https://openalex.org/W2104734478","https://openalex.org/W2107454643","https://openalex.org/W2136423509","https://openalex.org/W2150631659","https://openalex.org/W2165567889","https://openalex.org/W2172284060","https://openalex.org/W2403054319","https://openalex.org/W3121235808","https://openalex.org/W4253864964","https://openalex.org/W4285719527","https://openalex.org/W6658374471","https://openalex.org/W6684424317"],"related_works":["https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2055693471","https://openalex.org/W2119149496","https://openalex.org/W2139858675","https://openalex.org/W2180288160","https://openalex.org/W2358678896","https://openalex.org/W2102818760","https://openalex.org/W2888987343","https://openalex.org/W2153520172"],"abstract_inverted_index":{"We":[0,91],"present":[1],"O(n2)an":[2],"integer":[3],"linear":[4,100],"formulation":[5,20,137],"that":[6,79],"uses":[7],"the":[8,14,94,99,105,127,136],"so-called":[9],"\u201cdistance":[10],"variables\u201d":[11],"to":[12],"solve":[13],"quadratic":[15,52,106],"assignment":[16,53,107],"problem":[17,108],"(QAP).":[18],"The":[19],"performs":[21],"particularly":[22],"well":[23,74,117],"for":[24,50,61,67,157],"problems":[25,62],"with":[26,63,111,126],"Manhattan":[27,64,119,133],"distance":[28,65,114,120,134],"matrices.":[29,121],"It":[30],"involves":[31],"O(n2)":[32],"variables.":[33],"Valid":[34],"equalities":[35],"and":[36,55,81],"inequalities":[37,48],"are":[38,124],"proposed":[39],"divided":[40],"into":[41],"two":[42],"families.":[43],"First,":[44],"a":[45,57,139,145],"family":[46,58],"of":[47,104,154],"valid":[49,59],"any":[51],"problems,":[54],"second,":[56],"only":[60],"matrices,":[66,115,135],"which":[68,158],"we":[69],"exploit":[70],"metric":[71],"properties,":[72],"as":[73,75,116,118],"an":[76],"algebraic":[77],"characterization":[78],"Mittelman":[80],"Peng":[82],"(SIAM":[83],"J":[84],"Opt":[85],"2010:20(6),":[86],"3408\u20133426,":[87],"2010)":[88],"recently":[89],"proved.":[90],"numerically":[92],"tested":[93],"lower":[95,130,142,152],"bound":[96,143],"provided":[97],"by":[98],"relaxation":[101],"using":[102],"instances":[103,156],"library":[109],"(QAPLIB)":[110],"randomly":[112],"generated":[113],"Our":[122],"results":[123],"compared":[125],"best":[128,151],"known":[129],"bounds.":[131],"For":[132],"gives":[138],"very":[140],"competitive":[141],"in":[144],"short":[146],"computational":[147],"time,":[148],"improving":[149],"seven":[150],"bounds":[153],"QAPLIB":[155],"no":[159],"optimality":[160],"proofs":[161],"exist.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}