{"id":"https://openalex.org/W2144635724","doi":"https://doi.org/10.3233/sat190016","title":"March_dl: Adding Adaptive Heuristics and a New Branching Strategy","display_name":"March_dl: Adding Adaptive Heuristics and a New Branching Strategy","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2144635724","doi":"https://doi.org/10.3233/sat190016","mag":"2144635724"},"language":"en","primary_location":{"id":"doi:10.3233/sat190016","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190016","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190016?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190016","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190016?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190016","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marijn J.H. Heule","raw_affiliation_strings":["Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology. E-mails:\u00a0m.j.h.heule@ewi.tudelft.nl,\u00a0h.vanmaaren@ewi.tudelft.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology. E-mails:\u00a0m.j.h.heule@ewi.tudelft.nl,\u00a0h.vanmaaren@ewi.tudelft.nl","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084566377","display_name":"Hans van Maaren","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans van Maaren","raw_affiliation_strings":["Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology. E-mails:\u00a0m.j.h.heule@ewi.tudelft.nl,\u00a0h.vanmaaren@ewi.tudelft.nl"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology. E-mails:\u00a0m.j.h.heule@ewi.tudelft.nl,\u00a0h.vanmaaren@ewi.tudelft.nl","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025921874"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.7762,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82386468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"1-4","first_page":"47","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9940000176429749,"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.9940000176429749,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9937999844551086,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9865000247955322,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.8846263885498047},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8232340812683105},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6557755470275879},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.624617338180542},{"id":"https://openalex.org/keywords/adaptive-strategies","display_name":"Adaptive strategies","score":0.6243080496788025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5932517051696777},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4494023025035858},{"id":"https://openalex.org/keywords/competition","display_name":"Competition (biology)","score":0.4283324182033539},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3620603382587433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3315989673137665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3244484066963196},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24768275022506714},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21194800734519958},{"id":"https://openalex.org/keywords/history","display_name":"History","score":0.08889669179916382}],"concepts":[{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.8846263885498047},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8232340812683105},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6557755470275879},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.624617338180542},{"id":"https://openalex.org/C167393769","wikidata":"https://www.wikidata.org/wiki/Q4680768","display_name":"Adaptive strategies","level":2,"score":0.6243080496788025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5932517051696777},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4494023025035858},{"id":"https://openalex.org/C91306197","wikidata":"https://www.wikidata.org/wiki/Q45767","display_name":"Competition (biology)","level":2,"score":0.4283324182033539},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3620603382587433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3315989673137665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3244484066963196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24768275022506714},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21194800734519958},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.08889669179916382},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.3233/sat190016","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190016","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190016?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190016","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.101.3318","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.st.ewi.tudelft.nl/~heule/publications/JSAT2_3_Heule.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.5178","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.5178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume2/backup/JSAT2_3_Heule.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.97.443","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jsat.ewi.tudelft.nl/content/volume2/JSAT2_3_Heule.pdf","raw_type":"text"},{"id":"pmh:oai:tudelft.nl:uuid:ca32b265-ce9f-4105-9438-761a356eceb1","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:ca32b265-ce9f-4105-9438-761a356eceb1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"},{"id":"mag:2144635724","is_oa":true,"landing_page_url":"https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3Aca32b265-ce9f-4105-9438-761a356eceb1","pdf_url":null,"source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal on Satisfiability Boolean Modeling and Computation","raw_type":null}],"best_oa_location":{"id":"doi:10.3233/sat190016","is_oa":true,"landing_page_url":"https://doi.org/10.3233/sat190016","pdf_url":"https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190016?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190016","source":{"id":"https://openalex.org/S92264924","display_name":"Journal on Satisfiability Boolean Modeling and Computation","issn_l":"1574-0617","issn":["1574-0617","1875-5011"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal on Satisfiability, Boolean Modeling and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2144635724.pdf","grobid_xml":"https://content.openalex.org/works/W2144635724.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W14839205"],"related_works":["https://openalex.org/W2330199955","https://openalex.org/W24264677","https://openalex.org/W2113933946","https://openalex.org/W2097153130","https://openalex.org/W2025799810","https://openalex.org/W2613952967","https://openalex.org/W1742599129","https://openalex.org/W3195562319","https://openalex.org/W2149676416","https://openalex.org/W1598398537","https://openalex.org/W1835373201","https://openalex.org/W2784788793","https://openalex.org/W1533981606","https://openalex.org/W3039580867","https://openalex.org/W1748017702","https://openalex.org/W2152482818","https://openalex.org/W90023127","https://openalex.org/W1905614847","https://openalex.org/W1598839320","https://openalex.org/W1511775544"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,22,54,85],"march":[3,11,37,66,88],"dl":[4,67],"satisfiability":[5],"(SAT)":[6],"solver,":[7],"a":[8,40,62],"successor":[9],"of":[10,43,87],"eq.":[12],"The":[13,26],"latter":[14],"was":[15],"awarded":[16],"state-of-the-art":[17],"in":[18,36],"two":[19],"categories":[20],"during":[21],"Sat":[23],"2004":[24],"competition.":[25],"focus":[27],"lies":[28],"on":[29],"presenting":[30],"those":[31],"features":[32,45],"that":[33],"are":[34],"new":[35,63,99],"dl.":[38],"Besides":[39],"description,":[41],"each":[42],"these":[44,98],"is":[46,68],"illustrated":[47],"with":[48],"some":[49],"experimental":[50],"results.":[51],"By":[52],"extending":[53],"preprocessor,":[55],"using":[56,61],"adaptive":[57],"heuristics,":[58],"and":[59],"by":[60],"branching":[64],"strategy,":[65],"able":[69],"to":[70,97],"solve":[71],"nearly":[72],"all":[73],"benchmarks":[74],"faster":[75],"than":[76],"its":[77],"predecessor.":[78],"Moreover,":[79],"various":[80],"instances":[81],"which":[82],"were":[83],"beyond":[84],"reach":[86],"eq,":[89],"can":[90],"now":[91],"be":[92],"solved":[93],"-relatively":[94],"easily":[95],"-due":[96],"features.":[100]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}