{"id":"https://openalex.org/W1584884039","doi":"https://doi.org/10.1007/978-3-642-12139-5_9","title":"Ant Colony Optimization for Tree Decompositions","display_name":"Ant Colony Optimization for Tree Decompositions","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1584884039","doi":"https://doi.org/10.1007/978-3-642-12139-5_9","mag":"1584884039"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-12139-5_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12139-5_9","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/A5076381928","display_name":"Thomas Hammerl","orcid":null},"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":"Thomas Hammerl","raw_affiliation_strings":["Institute of Information Systems, Vienna University of Technology, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","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":["Institute of Information Systems, Vienna University of Technology, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6504,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83258278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"95","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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.9984999895095825,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9900000095367432,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9876999855041504,"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/metaheuristic","display_name":"Metaheuristic","score":0.7124363780021667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7083895206451416},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6421491503715515},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6326282024383545},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5284909009933472},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5213485956192017},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4981670379638672},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48070913553237915},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4399679899215698},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.41091465950012207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38538438081741333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2075963020324707},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.10569232702255249},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06997373700141907}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7124363780021667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7083895206451416},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6421491503715515},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6326282024383545},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5284909009933472},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5213485956192017},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4981670379638672},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48070913553237915},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4399679899215698},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.41091465950012207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38538438081741333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2075963020324707},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.10569232702255249},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06997373700141907},{"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":2,"locations":[{"id":"doi:10.1007/978-3-642-12139-5_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-12139-5_9","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:CiteSeerX.psu:10.1.1.395.4382","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.4382","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/treeEvoCop2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W179577048","https://openalex.org/W1492640216","https://openalex.org/W1557288165","https://openalex.org/W1566343863","https://openalex.org/W1573676079","https://openalex.org/W1584884039","https://openalex.org/W1628915153","https://openalex.org/W1801000304","https://openalex.org/W1801849579","https://openalex.org/W1991477862","https://openalex.org/W1995675321","https://openalex.org/W2029448190","https://openalex.org/W2098268683","https://openalex.org/W2107631366","https://openalex.org/W2107941094","https://openalex.org/W2125547222","https://openalex.org/W2154929945","https://openalex.org/W2174973502","https://openalex.org/W2552070334","https://openalex.org/W4237768137","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W2794855054","https://openalex.org/W4236055036","https://openalex.org/W2081475278","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W4321504838","https://openalex.org/W1588949866","https://openalex.org/W1975009952","https://openalex.org/W46882622"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}