{"id":"https://openalex.org/W1492069318","doi":"https://doi.org/10.1007/978-3-540-70807-0_5","title":"A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem","display_name":"A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1492069318","doi":"https://doi.org/10.1007/978-3-540-70807-0_5","mag":"1492069318"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-70807-0_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70807-0_5","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in 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/A5058985227","display_name":"Sandro Pirkwieser","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":true,"raw_author_name":"Sandro Pirkwieser","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria","Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"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":"G\u00fcnther R. Raidl","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria","Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078782153","display_name":"Jakob Puchinger","orcid":"https://orcid.org/0000-0001-7355-8070"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]},{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jakob Puchinger","raw_affiliation_strings":["NICTA Victoria Laboratory, The University of Melbourne, Australia","The University of Melbourne,"],"affiliations":[{"raw_affiliation_string":"NICTA Victoria Laboratory, The University of Melbourne, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I165779595"]},{"raw_affiliation_string":"The University of Melbourne,","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058985227"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":1.805,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8554729,"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":"69","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973999857902527,"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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.8647419214248657},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7966482043266296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6439581513404846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6066008806228638},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5334221720695496},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5289961099624634},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5263508558273315},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5075070261955261},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4990255832672119},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49022966623306274},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48635441064834595},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45241495966911316},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43406370282173157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36771053075790405},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.20290198922157288},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14223948121070862}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.8647419214248657},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7966482043266296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6439581513404846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6066008806228638},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5334221720695496},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5289961099624634},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5263508558273315},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5075070261955261},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4990255832672119},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49022966623306274},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48635441064834595},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45241495966911316},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43406370282173157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36771053075790405},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.20290198922157288},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14223948121070862},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-70807-0_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70807-0_5","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.4924","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.4924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ads.tuwien.ac.at/publications/bib/pdf/pirkwieser-07a.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01226565v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01226565","pdf_url":null,"source":{"id":"https://openalex.org/S4406922453","display_name":"SPIRE - Sciences Po Institutional REpository","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":"Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008, 978-3-540-70806-3. ⟨10.1007/978-3-540-70807-0_5⟩","raw_type":"Book sections"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W71437166","https://openalex.org/W1486718270","https://openalex.org/W1519748196","https://openalex.org/W1965680834","https://openalex.org/W2006820476","https://openalex.org/W2017927472","https://openalex.org/W2026880805","https://openalex.org/W2035177959","https://openalex.org/W2050014122","https://openalex.org/W2050146290","https://openalex.org/W2142146559","https://openalex.org/W2154355266","https://openalex.org/W2156293131","https://openalex.org/W2163367282","https://openalex.org/W2911835594","https://openalex.org/W4236384091"],"related_works":["https://openalex.org/W246960280","https://openalex.org/W2087209118","https://openalex.org/W2168163332","https://openalex.org/W2005493932","https://openalex.org/W179363847","https://openalex.org/W2381035939","https://openalex.org/W2145407993","https://openalex.org/W2378557713","https://openalex.org/W2141701778","https://openalex.org/W3169691842"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}