{"id":"https://openalex.org/W2133291040","doi":"https://doi.org/10.1109/cec.2010.5586481","title":"Local Optima Networks of the Quadratic Assignment Problem","display_name":"Local Optima Networks of the Quadratic Assignment Problem","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2133291040","doi":"https://doi.org/10.1109/cec.2010.5586481","mag":"2133291040"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2010.5586481","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1107.4161","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013668260","display_name":"Fabio Daolio","orcid":"https://orcid.org/0000-0003-4240-4161"},"institutions":[{"id":"https://openalex.org/I97565354","display_name":"University of Lausanne","ror":"https://ror.org/019whta54","country_code":"CH","type":"education","lineage":["https://openalex.org/I97565354"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fabio Daolio","raw_affiliation_strings":["Information Systems Department, Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"Information Systems Department, Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I97565354"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078220546","display_name":"Seb\u00e1stien V\u00e9rel","orcid":"https://orcid.org/0000-0003-1661-4093"},"institutions":[{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sebastien Verel","raw_affiliation_strings":["INRIA Lille-Nord Europe / CNRS, University of Nice-Sophia Antipolis, Nice, France","INRIA Lille - Nord Europe and University of Nice Sophia-Antipolis/CNRS, Nice, France"],"affiliations":[{"raw_affiliation_string":"INRIA Lille-Nord Europe / CNRS, University of Nice-Sophia Antipolis, Nice, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"INRIA Lille - Nord Europe and University of Nice Sophia-Antipolis/CNRS, Nice, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090624529","display_name":"Gabriela Ochoa","orcid":"https://orcid.org/0000-0001-7649-5669"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gabriela Ochoa","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK","Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning (ASAP) Group, School of Computer Science, University of Nottingham, Nottingham, UK#TAB#","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077231672","display_name":"Marco Tomassini","orcid":"https://orcid.org/0000-0002-9571-0683"},"institutions":[{"id":"https://openalex.org/I97565354","display_name":"University of Lausanne","ror":"https://ror.org/019whta54","country_code":"CH","type":"education","lineage":["https://openalex.org/I97565354"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marco Tomassini","raw_affiliation_strings":["Information Systems Department, Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"Information Systems Department, Faculty of Business and Economics, University of Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I97565354"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5013668260"],"corresponding_institution_ids":["https://openalex.org/I97565354"],"apc_list":null,"apc_paid":null,"fwci":3.5269,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.93858781,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.830041766166687},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.8198106288909912},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6153278350830078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5986813902854919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.58274245262146},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.527597963809967},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5041166543960571},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.49694064259529114},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4944791793823242},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4335263669490814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29912877082824707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23753607273101807},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10710182785987854}],"concepts":[{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.830041766166687},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.8198106288909912},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6153278350830078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5986813902854919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.58274245262146},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.527597963809967},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5041166543960571},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.49694064259529114},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4944791793823242},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4335263669490814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29912877082824707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23753607273101807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10710182785987854}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1109/cec.2010.5586481","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2010.5586481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1107.4161","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1107.4161","pdf_url":"https://arxiv.org/pdf/1107.4161","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.4282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~gxo/papers/LON-QAP-CEC2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.764.932","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.764.932","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1107.4161.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00487806v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00487806","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE world conference on computational intelligence (WCCI - CEC), Jul 2010, Barcelona, Spain. pp.3145 - 3152","raw_type":"Conference papers"},{"id":"pmh:oai:iris.unil.ch:iris/96255","is_oa":false,"landing_page_url":"https://iris.unil.ch/handle/iris/96255","pdf_url":null,"source":{"id":"https://openalex.org/S7407055444","display_name":"IRIS","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"},{"id":"pmh:oai:lilloa.univ-lille.fr:20.500.12210/28267","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12210/28267","pdf_url":null,"source":{"id":"https://openalex.org/S4306402203","display_name":"LillOA (Universit\u00e9 de Lille (University Of Lille))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210123514","host_organization_name":"Centre d'Etudes en Civilisations, Langues et Litt\u00e9ratures Etrang\u00e8res","host_organization_lineage":["https://openalex.org/I4210123514"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:serval.unil.ch:BIB_2DE3B610A72E","is_oa":false,"landing_page_url":"https://serval.unil.ch/notice/serval:BIB_2DE3B610A72E","pdf_url":null,"source":{"id":"https://openalex.org/S4306401797","display_name":"SERVAL (Universit\u00e9 de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210093590","host_organization_name":"Swiss School of Archaeology in Greece","host_organization_lineage":["https://openalex.org/I4210093590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WCCI 2010 IEEE World Congress on Computational Intelligence, pp. 3145-3152","raw_type":"inproceedings"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1107.4161","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1107.4161","pdf_url":"https://arxiv.org/pdf/1107.4161","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1605254393","https://openalex.org/W1766172370","https://openalex.org/W1964413221","https://openalex.org/W1973488611","https://openalex.org/W1982302394","https://openalex.org/W2020696014","https://openalex.org/W2058518193","https://openalex.org/W2061901927","https://openalex.org/W2073853984","https://openalex.org/W2080178200","https://openalex.org/W2086917808","https://openalex.org/W2098677716","https://openalex.org/W2105291362","https://openalex.org/W2161032864","https://openalex.org/W3100532415","https://openalex.org/W3121235808","https://openalex.org/W4207063358","https://openalex.org/W4388252848","https://openalex.org/W6636064254","https://openalex.org/W6637897474"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2887485518","https://openalex.org/W1655912143","https://openalex.org/W2560221187","https://openalex.org/W4287021660","https://openalex.org/W2156087782"],"abstract_inverted_index":{"Using":[0],"a":[1,14,32,102,157],"recently":[2],"proposed":[3,74],"model":[4,30,61,147],"for":[5,50,167],"combinatorial":[6,161,177],"landscapes,":[7,162],"Local":[8],"Optima":[9],"Networks":[10],"(LON),":[11],"we":[12,152],"conduct":[13],"thorough":[15],"analysis":[16,115],"of":[17,20,22,34,53,58,67,70,98,160,173],"two":[18,96],"types":[19,97],"instances":[21,124,136],"the":[23,35,39,43,47,51,65,83,106,111,114,122,134,143,165],"Quadratic":[24],"Assignment":[25],"Problem":[26],"(QAP).":[27],"This":[28],"network":[29,146],"is":[31,148],"reduction":[33],"landscape":[36],"in":[37,75,176],"which":[38],"nodes":[40],"correspond":[41],"to":[42,127,139],"local":[44,78,144],"optima,":[45],"and":[46,87,171],"edges":[48],"account":[49],"notion":[52,66],"adjacency":[54],"between":[55],"their":[56],"basins":[57],"attraction.":[59],"The":[60,77],"was":[62],"inspired":[63],"by":[64],"`inherent":[68],"network'":[69],"potential":[71],"energy":[72],"surfaces":[73],"physical-chemistry.":[76],"optima":[79,145],"networks":[80],"extracted":[81],"from":[82,101],"so":[84],"called":[85],"uniform":[86,135],"real-like":[88,123],"QAP":[89],"instances,":[90],"show":[91],"features":[92],"clearly":[93],"distinguishing":[94],"these":[95],"instances.":[99],"Apart":[100],"clear":[103],"confirmation":[104],"that":[105,154],"search":[107],"difficulty":[108,175],"increases":[109],"with":[110],"problem":[112,174],"dimension,":[113],"provides":[116,156],"new":[117,168],"confirming":[118],"evidence":[119],"explaining":[120],"why":[121],"are":[125,137],"easier":[126,138],"solve":[128,140],"exactly":[129],"using":[130],"heuristic":[131],"search,":[132],"while":[133],"approximately.":[141],"Although":[142],"still":[149],"under":[150],"development,":[151],"argue":[153],"it":[155],"novel":[158],"view":[159],"opening":[163],"up":[164],"possibilities":[166],"analytical":[169],"tools":[170],"understanding":[172],"optimization.":[178]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}