{"id":"https://openalex.org/W1755177257","doi":"https://doi.org/10.1007/978-3-319-23219-5_2","title":"Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP","display_name":"Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1755177257","doi":"https://doi.org/10.1007/978-3-319-23219-5_2","mag":"1755177257"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-23219-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-23219-5_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in 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/A5020658046","display_name":"David Allouche","orcid":"https://orcid.org/0000-0003-3549-4592"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Allouche","raw_affiliation_strings":["MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France"],"affiliations":[{"raw_affiliation_string":"MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065436134","display_name":"Simon de Givry","orcid":"https://orcid.org/0000-0002-2242-0458"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon de Givry","raw_affiliation_strings":["MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France"],"affiliations":[{"raw_affiliation_string":"MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026700325","display_name":"George Katsirelos","orcid":"https://orcid.org/0000-0002-3727-6698"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"George Katsirelos","raw_affiliation_strings":["MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France"],"affiliations":[{"raw_affiliation_string":"MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080878843","display_name":"Thomas Schiex","orcid":"https://orcid.org/0000-0001-6049-3415"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Schiex","raw_affiliation_strings":["MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France"],"affiliations":[{"raw_affiliation_string":"MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014387206","display_name":"Matthias Zytnicki","orcid":"https://orcid.org/0000-0002-4895-8731"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Zytnicki","raw_affiliation_strings":["MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France"],"affiliations":[{"raw_affiliation_string":"MIAT, UR-875, INRA, F-31320, Castanet Tolosan, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5020658046"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":11.5536,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.98826597,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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.9993000030517578,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9901999831199646,"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/backtracking","display_name":"Backtracking","score":0.7737559080123901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6888189315795898},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.673473596572876},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.6639918088912964},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6240013241767883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5696120858192444},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5587460398674011},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5356642007827759},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5221291184425354},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5176171064376831},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4561024308204651},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.4261312782764435},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.424582302570343},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41159236431121826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38170313835144043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3428589701652527},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3021412789821625},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.2957848310470581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2763631343841553},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09788435697555542}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7737559080123901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6888189315795898},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.673473596572876},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.6639918088912964},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6240013241767883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5696120858192444},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5587460398674011},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5356642007827759},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5221291184425354},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5176171064376831},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4561024308204651},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4261312782764435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.424582302570343},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41159236431121826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38170313835144043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3428589701652527},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3021412789821625},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.2957848310470581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2763631343841553},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09788435697555542},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"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},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"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.1007/978-3-319-23219-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-23219-5_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01198361v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01198361","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://archives-publications.inrae.fr/324377.pdf","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W46786713","https://openalex.org/W54850713","https://openalex.org/W91781137","https://openalex.org/W103975088","https://openalex.org/W137179583","https://openalex.org/W179577048","https://openalex.org/W198893173","https://openalex.org/W325136039","https://openalex.org/W1507841763","https://openalex.org/W1523360756","https://openalex.org/W1527745059","https://openalex.org/W1548566480","https://openalex.org/W1646038686","https://openalex.org/W1683857393","https://openalex.org/W1866098434","https://openalex.org/W1885913205","https://openalex.org/W1988443389","https://openalex.org/W2011292059","https://openalex.org/W2029448190","https://openalex.org/W2035601288","https://openalex.org/W2108687116","https://openalex.org/W2111175290","https://openalex.org/W2138319640","https://openalex.org/W2138403771","https://openalex.org/W2144931885","https://openalex.org/W2154055561","https://openalex.org/W2154318861","https://openalex.org/W2161076907","https://openalex.org/W2403489339","https://openalex.org/W4243384549","https://openalex.org/W4295846875"],"related_works":["https://openalex.org/W2224555876","https://openalex.org/W3098335909","https://openalex.org/W96515380","https://openalex.org/W2376570066","https://openalex.org/W2354057059","https://openalex.org/W3097309452","https://openalex.org/W3014882394","https://openalex.org/W4379471634","https://openalex.org/W1583052623","https://openalex.org/W1755177257"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}