{"id":"https://openalex.org/W28882840","doi":"https://doi.org/10.1090/dimacs/026/14","title":"Coloring by Tabu branch and bound","display_name":"Coloring by Tabu branch and bound","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W28882840","doi":"https://doi.org/10.1090/dimacs/026/14","mag":"28882840"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/026/14","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/14","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5068174754","display_name":"Fred Glover","orcid":"https://orcid.org/0000-0001-6945-0438"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fred Glover","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050055299","display_name":"M.B. Parker","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Parker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103262911","display_name":"Jennifer K. Ryan","orcid":"https://orcid.org/0000-0002-8045-8614"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jennifer Ryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7401,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.90360169,"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":"285","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9929999709129333,"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/tabu-search","display_name":"Tabu search","score":0.9122219085693359},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7674930095672607},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5786086320877075},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5585602521896362},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5549675226211548},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5352441072463989},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5112133026123047},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4702557325363159},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4629429578781128},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4624841809272766},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45169612765312195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42809727787971497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40924549102783203},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26681074500083923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16249707341194153},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.061445027589797974}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.9122219085693359},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7674930095672607},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5786086320877075},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5585602521896362},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5549675226211548},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5352441072463989},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5112133026123047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4702557325363159},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4629429578781128},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4624841809272766},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45169612765312195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42809727787971497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40924549102783203},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26681074500083923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16249707341194153},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.061445027589797974},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/026/14","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/14","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.417.6719","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.6719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://leeds-faculty.colorado.edu/glover/fred pubs/265 - TS - Coloring - Tabu B%26B DIMACS w Parker %26 Ryan.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2024060531","https://openalex.org/W2167036627"],"related_works":["https://openalex.org/W2224940485","https://openalex.org/W2168643831","https://openalex.org/W2075514833","https://openalex.org/W2381791171","https://openalex.org/W4247343174","https://openalex.org/W1987877777","https://openalex.org/W2033699305","https://openalex.org/W2535266198","https://openalex.org/W2168000780","https://openalex.org/W2061358444"],"abstract_inverted_index":{"Abstract.":[0],"We":[1,79,112],"give":[2],"an":[3,115],"adaptive":[4],"depth":[5,85],"procedure":[6],"for":[7,141],"coloring":[8],"a":[9,97,123,142],"graph":[10,108],"that":[11,91,158],"combines":[12],"elements":[13],"of":[14,31,34,43,88,99,106,118,144],"tabu":[15,23],"search":[16,45,51,55],"and":[17,19,25,39,86,95,128,154],"branch":[18,24],"bound.":[20],"The":[21,59],"resulting":[22],"bound":[26],"method":[27,138],"can":[28],"execute":[29],"searches":[30],"varying":[32],"degrees":[33],"exhaustiveness":[35],"at":[36,56,109],"different":[37,41],"stages":[38],"in":[40,156],"regions":[42],"the":[44,57,71,107,131],"space,":[46],"ranging":[47],"from":[48,150],"pure":[49,53],"heuristic":[50],"to":[52,63,73,103,121,125,129],"tree":[54],"extremes.":[58],"goal":[60],"is":[61,164],"generally":[62],"find":[64],"near":[65],"optimal":[66,75],"colorings":[67,76],"efficiently,":[68],"but":[69],"with":[70],"ability":[72],"obtain":[74],"if":[77],"desired.":[78],"introduce":[80],"new":[81],"theoretical":[82],"results":[83],"concerning":[84],"width":[87],"local":[89],"optima":[90],"motivate":[92],"our":[93,137],"approach,":[94],"employ":[96,114],"concept":[98],"color":[100,132],"conditioned":[101],"dependency":[102],"permit":[104],"shrinking":[105],"appropriate":[110],"stages.":[111],"also":[113],"associated":[116],"notion":[117],"node":[119,124],"danger":[120],"select":[122],"be":[126],"colored":[127],"determine":[130],"assigned.":[133],"Computational":[134],"experiments":[135],"show":[136],"performs":[139],"effectively":[140],"variety":[143],"problem":[145],"types,":[146],"including":[147],"those":[148],"taken":[149],"real":[151],"world":[152],"applications,":[153],"notably":[155],"graphs":[157],"are":[159],"not":[160],"excessively":[161],"dense":[162],"(as":[163],"typical":[165]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}