{"id":"https://openalex.org/W2572748071","doi":"https://doi.org/10.1090/dimacs/035/14","title":"Surrogate constraint analysis\u2014new heuristics and learning schemes for satisfiability problems","display_name":"Surrogate constraint analysis\u2014new heuristics and learning schemes for satisfiability problems","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W2572748071","doi":"https://doi.org/10.1090/dimacs/035/14","mag":"2572748071"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/14","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/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/A5028306102","display_name":"Arne L\u00f8kketangen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arne Lokketangen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028306102"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.5854,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9672323,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"537","last_page":"572"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9948999881744385,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9948999881744385,"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/T11596","display_name":"Constraint Satisfaction and Optimization","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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9876000285148621,"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.849645733833313},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.7116931676864624},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5362391471862793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5313478112220764},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3856629431247711},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3424665331840515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28810450434684753}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.849645733833313},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.7116931676864624},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5362391471862793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5313478112220764},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3856629431247711},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3424665331840515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28810450434684753},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/035/14","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/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"}],"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/W1667614912","https://openalex.org/W1972497158","https://openalex.org/W1981134802","https://openalex.org/W2017127020","https://openalex.org/W2045467381","https://openalex.org/W2053301303","https://openalex.org/W2076163541","https://openalex.org/W2076756604","https://openalex.org/W2081751877","https://openalex.org/W2088888085","https://openalex.org/W2092993939","https://openalex.org/W2104670598","https://openalex.org/W2110376540","https://openalex.org/W2157054705","https://openalex.org/W2164855953","https://openalex.org/W2914275007"],"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/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W4297690216","https://openalex.org/W1690653314","https://openalex.org/W2349580982"],"abstract_inverted_index":{"Surrogate":[0],"constraint":[1,28,82,127,196],"analysis":[2,128,197],"has":[3,181],"been":[4,184,216],"applied":[5],"effectively":[6],"to":[7,33,41,137,160,165,176],"a":[8,15,107,111,118,133,162,174,226],"variety":[9],"of":[10,36,44,110,141,151,156,171,194,236],"combinatorial":[11],"optimization":[12],"problems,":[13],"as":[14,106],"foundation":[16],"for":[17,56,73],"both":[18],"exact":[19,69],"and":[20,40,54,70,84,90,123,198,232,242],"heuristic":[21,25,71],"methods.":[22],"In":[23],"the":[24,34,42,66,100,139,167,177,187,192],"domain,":[26],"surrogate":[27,81,126,195,230],"methods":[29,83,86],"are":[30,52,77],"particularly":[31,134],"suited":[32],"creation":[35],"associated":[37],"learning":[38,91,163,200,243],"procedures":[39,72],"application":[43],"probabilistic":[45,85,205,212],"decisions.":[46],"We":[47,97,189],"show":[48,98],"that":[49,65,87,99,180,191,210,214],"these":[50],"approaches":[51],"natural":[53],"effective":[55,203],"satisfiability":[57],"(SAT)":[58],"problems.":[59],"Added":[60],"motivation":[61],"comes":[62],"from":[63,94],"observing":[64],"current":[67],"best":[68],"multidimensional":[74,113],"knapsack":[75,114],"problems":[76],"provided":[78],"independently":[79],"by":[80],"use":[88,170],"memory":[89,153,172,241],"structures":[92,154],"(derived":[93],"tabu":[95,157],"search).":[96],"SAT":[101,221],"problem":[102,115],"can":[103,129],"be":[104,130],"formulated":[105],"special":[108],"instance":[109],"binary-choice":[112,119],"(or":[116],"equivalently,":[117],"generalized":[120],"covering":[121],"problem),":[122],"demonstrate":[124],"how":[125],"specialized":[131],"in":[132,186,219],"convenient":[135],"way":[136],"exploit":[138],"structure":[140],"this":[142],"problem.":[143],"Our":[144],"approach":[145],"incorporates":[146],"simple":[147,199],"(first":[148],"order)":[149],"instances":[150],"adaptive":[152,240],"characteristic":[155],"search":[158,206],"implementations,":[159],"give":[161],"effect":[164],"guide":[166],"search.":[168],"This":[169],"adds":[173],"dimension":[175],"solution":[178],"process":[179],"not":[182],"adequately":[183],"examined":[185],"past.":[188],"find":[190],"combination":[193],"proves":[201],"more":[202,233],"than":[204],"designs,":[207],"including":[208],"those":[209],"encompass":[211],"rules":[213],"have":[215],"highly":[217],"favored":[218],"previous":[220],"approaches.":[222],"These":[223],"outcomes":[224],"motivate":[225],"closer":[227],"look":[228],"at":[229],"strategies":[231],"advanced":[234],"ways":[235],"integrating":[237],"them":[238],"with":[239],"procedures.":[244]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}