{"id":"https://openalex.org/W1774918921","doi":"https://doi.org/10.3233/inf-2000-11204","title":"An Intensive Search Algorithm for the Quadratic Assignment Problem","display_name":"An Intensive Search Algorithm for the Quadratic Assignment Problem","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1774918921","doi":"https://doi.org/10.3233/inf-2000-11204","mag":"1774918921"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.905","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.905","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mii.lt/Informatica/pdf/INFO207.pdf","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011891002","display_name":"Alfonsas Misevi\u010dius","orcid":"https://orcid.org/0000-0002-3746-8200"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alfonsas Misevi\u010dius","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3746-8200","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5011891002"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1318,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78845505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"2","first_page":"145","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7016711235046387},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6907998919487},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6189075112342834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5751539468765259},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.572600245475769},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5242196321487427},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.5189392566680908},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5093401670455933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5044578313827515},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.490211546421051},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4660879969596863},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.42294052243232727},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.41616347432136536},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.316802978515625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3048577308654785},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.2863951027393341}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7016711235046387},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6907998919487},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6189075112342834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5751539468765259},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.572600245475769},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5242196321487427},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.5189392566680908},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5093401670455933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5044578313827515},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.490211546421051},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4660879969596863},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.42294052243232727},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.41616347432136536},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.316802978515625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3048577308654785},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2863951027393341}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.905","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.905","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mii.lt/Informatica/pdf/INFO207.pdf","raw_type":"text"},{"id":"mag:1774918921","is_oa":false,"landing_page_url":"https://www.mii.lt/informatica/pdf/INFO207.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Informatica","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1569366990","https://openalex.org/W1772988327","https://openalex.org/W1966953343","https://openalex.org/W1971700807","https://openalex.org/W1976764133","https://openalex.org/W1984297012","https://openalex.org/W2004229681","https://openalex.org/W2009832821","https://openalex.org/W2016688797","https://openalex.org/W2027799917","https://openalex.org/W2031409011","https://openalex.org/W2049299385","https://openalex.org/W2066883591","https://openalex.org/W2093475907","https://openalex.org/W2397897876","https://openalex.org/W2403173049"],"related_works":["https://openalex.org/W2016688797","https://openalex.org/W1579623473","https://openalex.org/W2019121500","https://openalex.org/W3105888594","https://openalex.org/W2734093795","https://openalex.org/W1523156322","https://openalex.org/W1991761965","https://openalex.org/W2280269595","https://openalex.org/W2767958689","https://openalex.org/W1552301993","https://openalex.org/W2053189771","https://openalex.org/W2166580144","https://openalex.org/W2093475907","https://openalex.org/W2066883591","https://openalex.org/W2051391874","https://openalex.org/W2048698391","https://openalex.org/W2032990086","https://openalex.org/W2023485317","https://openalex.org/W2016445775","https://openalex.org/W1971700807"],"abstract_inverted_index":{"Abstract.":[0],"Many":[1],"heuristics,":[2,88],"such":[3],"as":[4,38],"simulated":[5,84],"annealing,":[6],"genetic":[7],"algorithms,":[8],"greedy":[9],"randomized":[10],"adaptive":[11],"search":[12,40],"procedures":[13],"are":[14],"stochastic.":[15],"In":[16],"this":[17,35],"paper,":[18],"we":[19],"propose":[20],"a":[21],"deterministic":[22],"heuristic":[23],"algorithm,":[24],"which":[25],"is":[26],"applied":[27],"to":[28,37,79],"the":[29,51,55,58,67,71,80],"quadratic":[30,91],"assignment":[31,92],"problem.":[32,93],"We":[33,46],"refer":[34],"algorithm":[36,41,49,73,82],"intensive":[39,44,89],"(or":[42],"briefly":[43],"search).":[45],"tested":[47],"our":[48],"on":[50],"various":[52],"instances":[53,60],"from":[54,66],"library":[56],"of":[57],"QAP":[59],"\u2013":[61,83],"QAPLIB.":[62],"The":[63],"results":[64],"obtained":[65],"experiments":[68],"show":[69],"that":[70],"proposed":[72],"appears":[74],"superior,":[75],"in":[76],"many":[77],"cases,":[78],"well-known":[81],"annealing.":[85],"Key":[86],"words:":[87],"search,":[90],"1.":[94]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}