{"id":"https://openalex.org/W1498658010","doi":"https://doi.org/10.1007/3-540-51687-5_49","title":"Communication heuristics in distributed combinatorial search algorithms","display_name":"Communication heuristics in distributed combinatorial search algorithms","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1498658010","doi":"https://doi.org/10.1007/3-540-51687-5_49","mag":"1498658010"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-51687-5_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51687-5_49","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/A5019265364","display_name":"Alfred Taudes","orcid":"https://orcid.org/0000-0002-7459-5823"},"institutions":[{"id":"https://openalex.org/I102248843","display_name":"Vienna University of Economics and Business","ror":"https://ror.org/03yn8s215","country_code":"AT","type":"education","lineage":["https://openalex.org/I102248843"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Alfred Taudes","raw_affiliation_strings":["Department of Applied Computer Science Institute of Information Processing and Information Economics, Vienna University of Economics and Business Administration, Augasse 2-6, A-1090, Vienna, Austria","VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS ADMINISTRATION"],"affiliations":[{"raw_affiliation_string":"Department of Applied Computer Science Institute of Information Processing and Information Economics, Vienna University of Economics and Business Administration, Augasse 2-6, A-1090, Vienna, Austria","institution_ids":["https://openalex.org/I102248843"]},{"raw_affiliation_string":"VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS ADMINISTRATION","institution_ids":["https://openalex.org/I102248843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019265364"],"corresponding_institution_ids":["https://openalex.org/I102248843"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.57,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65301003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9973999857902527,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9972000122070312,"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/computer-science","display_name":"Computer science","score":0.8447734117507935},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6017615795135498},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5901782512664795},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.554252028465271},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5355584025382996},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.523393452167511},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.5078631043434143},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.47998520731925964},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4737820625305176},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.43463167548179626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4036954343318939},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3790147006511688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35199597477912903},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.30174770951271057},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2673782706260681},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.18186989426612854},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.1242692768573761}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8447734117507935},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6017615795135498},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5901782512664795},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.554252028465271},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5355584025382996},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.523393452167511},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.5078631043434143},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.47998520731925964},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4737820625305176},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43463167548179626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4036954343318939},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3790147006511688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35199597477912903},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30174770951271057},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2673782706260681},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.18186989426612854},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.1242692768573761},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-51687-5_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51687-5_49","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:research.wu.ac.at:openaire_cris_publications/f1ee2fd6-32e2-4041-ba84-eb0b4adba8e6","is_oa":false,"landing_page_url":"https://research.wu.ac.at/de/publications/f1ee2fd6-32e2-4041-ba84-eb0b4adba8e6","pdf_url":null,"source":{"id":"https://openalex.org/S7407055123","display_name":"WU Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Taudes, A 1989, Communication Heuristics in Distributed Combinatorial Search Algorithms. in Lecture Notes in Computer Science 392 - Distributed Algorithms, 268-279, Springer 1989.","raw_type":"info:eu-repo/semantics/bookPart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W34076215","https://openalex.org/W1505491724","https://openalex.org/W1866420487","https://openalex.org/W1971262016","https://openalex.org/W1984263429","https://openalex.org/W2046577860","https://openalex.org/W2051315758","https://openalex.org/W2082897183","https://openalex.org/W2095687239","https://openalex.org/W2147110864","https://openalex.org/W2157803532","https://openalex.org/W2164294821","https://openalex.org/W2753176400","https://openalex.org/W2795693315","https://openalex.org/W4233294240","https://openalex.org/W4247557026","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2115367137","https://openalex.org/W3213700174","https://openalex.org/W2120609036","https://openalex.org/W2208339373","https://openalex.org/W2354057059","https://openalex.org/W2042460203","https://openalex.org/W2064794194","https://openalex.org/W2540870307","https://openalex.org/W2808808802","https://openalex.org/W2008047931"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}