{"id":"https://openalex.org/W1026269243","doi":"https://doi.org/10.1007/978-3-662-43505-2_64","title":"Metaheuristic Algorithms and Tree Decomposition","display_name":"Metaheuristic Algorithms and Tree Decomposition","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1026269243","doi":"https://doi.org/10.1007/978-3-662-43505-2_64","mag":"1026269243"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-43505-2_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43505-2_64","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Handbook of Computational Intelligence","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/A5076381928","display_name":"Thomas Hammerl","orcid":null},"institutions":[{"id":"https://openalex.org/I2802999219","display_name":"Austrian Federal Railways","ror":"https://ror.org/03jbq7a32","country_code":"AT","type":"government","lineage":["https://openalex.org/I2802999219"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Thomas Hammerl","raw_affiliation_strings":["Westbahnstra\u00dfe 25/1/7, 1070, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Westbahnstra\u00dfe 25/1/7, 1070, Vienna, Austria","institution_ids":["https://openalex.org/I2802999219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084546772","display_name":"Nysret Musliu","orcid":"https://orcid.org/0000-0002-3992-8637"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nysret Musliu","raw_affiliation_strings":["Inst. Information Systems, Vienna University of Technology, Favoritenstra\u00dfe 9, 1000, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Inst. Information Systems, Vienna University of Technology, Favoritenstra\u00dfe 9, 1000, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010187215","display_name":"Werner Schafhauser","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Werner Schafhauser","raw_affiliation_strings":["XIMES, Hollandstra\u00dfe 12/12, 1020, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"XIMES, Hollandstra\u00dfe 12/12, 1020, Vienna, Austria","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076381928"],"corresponding_institution_ids":["https://openalex.org/I2802999219"],"apc_list":null,"apc_paid":null,"fwci":4.1256,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.92635177,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1255","last_page":"1270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/tree-decomposition","display_name":"Tree decomposition","score":0.8773115277290344},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6938966512680054},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6356130242347717},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4817657470703125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48032084107398987},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.476443350315094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4741216003894806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4634421169757843},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.441056489944458},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.43468815088272095},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.42138975858688354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36785268783569336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3461662530899048},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.21916529536247253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17369723320007324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16281843185424805},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1245255172252655},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.06571012735366821}],"concepts":[{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.8773115277290344},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6938966512680054},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6356130242347717},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4817657470703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48032084107398987},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.476443350315094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4741216003894806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4634421169757843},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.441056489944458},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.43468815088272095},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.42138975858688354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36785268783569336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3461662530899048},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.21916529536247253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17369723320007324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16281843185424805},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1245255172252655},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.06571012735366821},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-43505-2_64","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-43505-2_64","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Handbook of Computational Intelligence","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.4647","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.4647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dbai.tuwien.ac.at/staff/musliu/TreeDecompChap.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W98056105","https://openalex.org/W186390149","https://openalex.org/W1492640216","https://openalex.org/W1497256448","https://openalex.org/W1537221987","https://openalex.org/W1553970977","https://openalex.org/W1557288165","https://openalex.org/W1566343863","https://openalex.org/W1572383262","https://openalex.org/W1573676079","https://openalex.org/W1584884039","https://openalex.org/W1586178866","https://openalex.org/W1593793857","https://openalex.org/W1628915153","https://openalex.org/W1801000304","https://openalex.org/W1801849579","https://openalex.org/W1973310391","https://openalex.org/W1976513369","https://openalex.org/W1991477862","https://openalex.org/W1995675321","https://openalex.org/W2024060531","https://openalex.org/W2029448190","https://openalex.org/W2036618810","https://openalex.org/W2040947692","https://openalex.org/W2080959483","https://openalex.org/W2084792706","https://openalex.org/W2085550081","https://openalex.org/W2089465933","https://openalex.org/W2098268683","https://openalex.org/W2098854122","https://openalex.org/W2107631366","https://openalex.org/W2107941094","https://openalex.org/W2116793595","https://openalex.org/W2123302126","https://openalex.org/W2125547222","https://openalex.org/W2146325624","https://openalex.org/W2154929945","https://openalex.org/W2174973502","https://openalex.org/W2207672057","https://openalex.org/W3022584652","https://openalex.org/W3121748795","https://openalex.org/W4299796063","https://openalex.org/W6600708310"],"related_works":["https://openalex.org/W3154623308","https://openalex.org/W4324285136","https://openalex.org/W2053583257","https://openalex.org/W325136039","https://openalex.org/W2040947692","https://openalex.org/W49964765","https://openalex.org/W2403489339","https://openalex.org/W1026269243","https://openalex.org/W2099439930","https://openalex.org/W2078806313"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}