{"id":"https://openalex.org/W2061590551","doi":"https://doi.org/10.1137/s1052623494273393","title":"Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem","display_name":"Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2061590551","doi":"https://doi.org/10.1137/s1052623494273393","mag":"2061590551"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494273393","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494273393","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"P. M. Pardalos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034081156","display_name":"K. G. Ramakrishnan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. G. Ramakrishnan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029261812","display_name":"Maur\u00edcio G. C. Resende","orcid":"https://orcid.org/0000-0001-7462-6207"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. G. C. Resende","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055095499","display_name":"Y. Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y. Li","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5050062467"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.2181,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.97507454,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":"1","first_page":"280","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9995999932289124,"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":0.9995999932289124,"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.9988999962806702,"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.9937000274658203,"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/branch-and-bound","display_name":"Branch and bound","score":0.7682623267173767},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7040740847587585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6847646832466125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.655555248260498},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5420101881027222},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4675513505935669},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4531330466270447},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.44222456216812134},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33980002999305725},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.23530036211013794}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7682623267173767},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7040740847587585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6847646832466125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.655555248260498},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5420101881027222},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4675513505935669},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4531330466270447},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.44222456216812134},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33980002999305725},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.23530036211013794},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623494273393","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494273393","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.4016","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.4016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~mgcr/doc/qapbb.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W60343698","https://openalex.org/W197491803","https://openalex.org/W1560792291","https://openalex.org/W1595806655","https://openalex.org/W1965651580","https://openalex.org/W1966081460","https://openalex.org/W1966953343","https://openalex.org/W1971700807","https://openalex.org/W1972445234","https://openalex.org/W1986166937","https://openalex.org/W2001443617","https://openalex.org/W2002859963","https://openalex.org/W2009832821","https://openalex.org/W2010971800","https://openalex.org/W2016688797","https://openalex.org/W2019821443","https://openalex.org/W2027799917","https://openalex.org/W2029983132","https://openalex.org/W2038681403","https://openalex.org/W2041011899","https://openalex.org/W2044973895","https://openalex.org/W2049299385","https://openalex.org/W2061796216","https://openalex.org/W2078152952","https://openalex.org/W2081821176","https://openalex.org/W2084512390","https://openalex.org/W2089362700","https://openalex.org/W2093475907","https://openalex.org/W2107454643","https://openalex.org/W2120091187","https://openalex.org/W2888871578","https://openalex.org/W2997776631","https://openalex.org/W3121235808","https://openalex.org/W4301474483"],"related_works":["https://openalex.org/W2389899617","https://openalex.org/W1591098987","https://openalex.org/W1931020284","https://openalex.org/W4319942994","https://openalex.org/W2044707039","https://openalex.org/W2746585819","https://openalex.org/W2028714537","https://openalex.org/W2182290077","https://openalex.org/W2060252799","https://openalex.org/W2213483440"],"abstract_inverted_index":{"The":[0,60,95],"efficient":[1,35],"implementation":[2,36],"of":[3,21,37,54,110,133,141,145],"a":[4,84,131],"branch-and-bound":[5,38,49,61,147],"algorithm":[6,50,62,73,126,152],"for":[7,34,40,90,103],"the":[8,14,41,48,64,71,75,108,119,124,139,146,150,154],"quadratic":[9],"assignment":[10],"problem":[11],"(QAP),":[12],"incorporating":[13],"lower":[15,66,79,156],"bound":[16],"based":[17],"on":[18,51,130],"variance":[19,136],"reduction":[20],"Li,":[22],"Pardalos,":[23],"Ramakrishnan,":[24],"and":[25,113],"Resende":[26],"(1994),":[27],"is":[28,43,68],"presented.":[29],"A":[30],"new":[31,65,120,125],"data":[32,135],"structure":[33],"algorithms":[39,96],"QAP":[42,55],"introduced.":[44],"Computational":[45],"experiments":[46],"with":[47,70,118],"different":[52],"classes":[53],"test":[56],"problems":[57],"are":[58],"reported.":[59],"using":[63,153],"bounds":[67],"compared":[69],"same":[72,151],"utilizing":[74],"commonly":[76],"applied":[77],"Gilmore--Lawler":[78,155],"bound.":[80,157],"Both":[81],"implementations":[82],"use":[83],"greedy":[85],"randomized":[86],"adaptive":[87],"search":[88],"procedure":[89],"obtaining":[91],"initial":[92],"upper":[93],"bounds.":[94],"report":[97],"all":[98],"optimal":[99],"permutations.":[100],"Optimal":[101],"solutions":[102],"previously":[104],"unsolved":[105],"instances":[106],"from":[107],"literature,":[109],"dimensions":[111],"$n=16$":[112],"$n=20$,":[114],"have":[115],"been":[116,128],"found":[117],"algorithm.":[121],"In":[122],"addition,":[123],"has":[127],"tested":[129],"class":[132],"large":[134],"problems,":[137],"requiring":[138],"examination":[140],"much":[142],"fewer":[143],"nodes":[144],"tree":[148],"than":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}