{"id":"https://openalex.org/W2406315113","doi":"https://doi.org/10.1090/dimacs/026/29","title":"Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability","display_name":"Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2406315113","doi":"https://doi.org/10.1090/dimacs/026/29","mag":"2406315113"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/026/29","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/29","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/A5108468106","display_name":"Charles Fleurent","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles Fleurent","raw_affiliation_strings":["A T & T Bell Laboratories, Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"A T & T Bell Laboratories, Murray Hill, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110184720","display_name":"Jacques A. Ferland","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacques Ferland","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.6154,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.99104196,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"619","last_page":"652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9828000068664551,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9828000068664551,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10533","display_name":"Teaching and Learning Programming","score":0.9775000214576721,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/graph-coloring","display_name":"Graph coloring","score":0.7988909482955933},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7251391410827637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5803446173667908},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5731465220451355},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5239788889884949},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4915636479854584},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4457877576351166},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.43979620933532715},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4032728374004364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3498803973197937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3431546986103058},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3244481682777405},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17849531769752502},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11034619808197021},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10720512270927429}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7988909482955933},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7251391410827637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5803446173667908},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5731465220451355},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5239788889884949},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4915636479854584},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4457877576351166},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.43979620933532715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4032728374004364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3498803973197937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3431546986103058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3244481682777405},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17849531769752502},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11034619808197021},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10720512270927429}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/026/29","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/29","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W1796509207","https://openalex.org/W2091617677","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Using":[0],"object-oriented":[1],"design":[2],"and":[3,15,28],"the":[4,23],"C++":[5],"programming":[6],"language,":[7],"generic":[8],"operators":[9,19],"are":[10,20],"developed":[11],"for":[12,22,36],"tabu":[13],"search":[14],"genetic":[16],"algorithms.":[17],"These":[18],"used":[21],"graph":[24],"coloring,":[25],"maximum":[26],"clique":[27],"satisfiability":[29],"problems.":[30],"The":[31],"availability":[32],"of":[33],"all":[34],"methods":[35],"each":[37],"problem":[38],"permits":[39],"to":[40],"consider":[41],"hybrid":[42],"schemes.":[43]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}