{"id":"https://openalex.org/W2172233297","doi":"https://doi.org/10.1137/0402046","title":"Average Performance of Heuristics for Satisfiability","display_name":"Average Performance of Heuristics for Satisfiability","publication_year":1989,"publication_date":"1989-11-01","ids":{"openalex":"https://openalex.org/W2172233297","doi":"https://doi.org/10.1137/0402046","mag":"2172233297"},"language":"en","primary_location":{"id":"doi:10.1137/0402046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402046","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5049923212","display_name":"Rajeev Kohli","orcid":"https://orcid.org/0000-0003-3466-8028"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Kohli","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramesh Krishnamurti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1764,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88667772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"4","first_page":"508","last_page":"523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9986000061035156,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.844109833240509},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7371339797973633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7226153016090393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5197598338127136},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48885124921798706},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3726307153701782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34023019671440125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31180572509765625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.270086407661438}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.844109833240509},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7371339797973633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7226153016090393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5197598338127136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48885124921798706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3726307153701782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34023019671440125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31180572509765625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.270086407661438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0402046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0402046","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"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/W1969377401","https://openalex.org/W1977838253","https://openalex.org/W1978788704","https://openalex.org/W1985246949","https://openalex.org/W2005180798","https://openalex.org/W2009931551","https://openalex.org/W2022695609","https://openalex.org/W2040924621","https://openalex.org/W2057361103","https://openalex.org/W2066544826","https://openalex.org/W2076655037","https://openalex.org/W2095697425","https://openalex.org/W2111869817","https://openalex.org/W2114190384","https://openalex.org/W2610893972","https://openalex.org/W4236154753"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W3037419933","https://openalex.org/W44982509","https://openalex.org/W2952234674","https://openalex.org/W1543051890","https://openalex.org/W4299809933"],"abstract_inverted_index":{"Distribution-free":[0],"tight":[1],"lower":[2,49],"bounds":[3],"on":[4,51],"the":[5,32,41,45,52,61,68,71,75,81,89,97,101,107,113,121,127,132,136,146],"average":[6,53,129],"performance":[7],"ratio":[8],"for":[9,12,17,24],"random":[10,33],"search,":[11],"a":[13,18,94],"greedy":[14,20,54,72,83,138],"heuristic":[15,21,73,139],"and":[16,63,118],"probabilistic":[19,82],"are":[22,86],"derived":[23],"an":[25],"optimization":[26],"version":[27],"of":[28,40,44,60,70,99,120,131,145],"satisfiability.":[29],"On":[30],"average,":[31],"solution":[34,55,103,109],"is":[35,56,140],"never":[36],"worse":[37],"than":[38,143],"$\\frac{1}{2}$":[39,59],"optimal,":[42,62],"regardless":[43,119],"data-generating":[46],"distribution.":[47],"The":[48],"bound":[50,65],"at":[57,77],"least":[58],"this":[64],"increases":[66],"with":[67],"probability":[69,98],"selecting":[74],"optimal":[76,102],"each":[78],"step.":[79],"In":[80],"heuristic,":[84],"probabilities":[85],"introduced":[87],"into":[88],"search":[90],"strategy":[91],"so":[92],"that":[93],"decrease":[95],"in":[96],"finding":[100],"occurs":[104],"only":[105],"if":[106],"nonoptimal":[108],"becomes":[110],"closer":[111],"to":[112,125],"optimal.":[114,147],"Across":[115],"problem":[116],"instances,":[117],"distribution":[122],"giving":[123],"rise":[124],"data,":[126],"minimum":[128],"value":[130],"solutions":[133],"identified":[134],"by":[135],"robabilistic":[137],"no":[141],"less":[142],"$\\frac{2}{3}$":[144]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}