{"doi":"10.1007/bf00998631","title":"Theoretical comparisons of search strategies in branch-and-bound algorithms","abstract":null,"journal":"International Journal of Computer & Information Sciences","year":1976,"id":31470,"datarank":9.180523146658341,"base_score":4.6913478822291435,"endowment":4.6913478822291435,"self_citation_contribution":0.7037021823343717,"citation_network_contribution":8.47682096432397,"self_endowment_contribution":0.7037021823343717,"citer_contribution":8.47682096432397,"corpus_percentile":null,"corpus_rank":null,"citation_count":108,"citer_count":100,"citers_with_citation_signal":84,"citers_with_endowment":84,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":168612,"name":"Toshihide Ibaraki","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.6913478822291435,"endowment":4.6913478822291435,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2081821176","authors":[],"funders":[],"total_grants":0,"fwci":10.0251,"citation_percentile":0.9758871,"influential_citations":2,"citation_trend":[{"year":2012,"count":6},{"year":2013,"count":1},{"year":2014,"count":4},{"year":2015,"count":3},{"year":2016,"count":2},{"year":2017,"count":2},{"year":2018,"count":1},{"year":2020,"count":1},{"year":2021,"count":4},{"year":2022,"count":1},{"year":2023,"count":1},{"year":2024,"count":4},{"year":2025,"count":1}],"oa_status":"closed","license":"http://www.springer.com/tdm","oa_locations":[{"url":"http://link.springer.com/content/pdf/10.1007/BF00998631.pdf","host_type":"publisher"},{"url":"http://link.springer.com/article/10.1007/BF00998631/fulltext.html","host_type":"publisher"},{"url":"http://link.springer.com/content/pdf/10.1007/BF00998631","host_type":"publisher"},{"url":"https://doi.org/10.1007/bf00998631","host_type":"journal"}],"fields_of_study":["Metaheuristic Optimization Algorithms Research","Optimization and Packing Problems","Optimization and Search Problems","Computer Science"],"mesh_terms":[],"keywords":["Incremental heuristic search","Beam search","Best-first search","Heuristic","Null-move heuristic","Search algorithm","Consistent heuristic","Iterative deepening depth-first search","Bidirectional search","Algorithm","Hill climbing","Depth-first search","Computer science","Stability (learning theory)","Upper and lower bounds","Beam stack search","Branch and bound","Mathematical optimization","Mathematics","Machine learning"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T07:15:01.980256Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}