{"id":"https://openalex.org/W2958243988","doi":"https://doi.org/10.1145/3319619.3326883","title":"Minimum spanning tree-based clustering of large pareto archives","display_name":"Minimum spanning tree-based clustering of large pareto archives","publication_year":2019,"publication_date":"2019-07-10","ids":{"openalex":"https://openalex.org/W2958243988","doi":"https://doi.org/10.1145/3319619.3326883","mag":"2958243988"},"language":"en","primary_location":{"id":"doi:10.1145/3319619.3326883","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319619.3326883","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","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/A5011598685","display_name":"Andrzej Jaszkiewicz","orcid":"https://orcid.org/0000-0002-8337-888X"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Andrzej Jaszkiewicz","raw_affiliation_strings":["Poznan University of Technology"],"affiliations":[{"raw_affiliation_string":"Poznan University of Technology","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011598685"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0954955,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1252","last_page":"1253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904999732971191,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7957106828689575},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7853238582611084},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6541608572006226},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6093584299087524},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5869802236557007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5510485768318176},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5224020481109619},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5207733511924744},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.508021354675293},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4881935715675354},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4703804552555084},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44427138566970825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3844909369945526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.251899391412735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2348310351371765},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21771103143692017}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7957106828689575},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7853238582611084},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6541608572006226},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6093584299087524},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5869802236557007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5510485768318176},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5224020481109619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5207733511924744},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.508021354675293},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4881935715675354},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4703804552555084},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44427138566970825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3844909369945526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.251899391412735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2348310351371765},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21771103143692017},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3319619.3326883","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319619.3326883","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1607098015","https://openalex.org/W1976496412","https://openalex.org/W1990912193","https://openalex.org/W2086472385","https://openalex.org/W2109778277","https://openalex.org/W2127474646","https://openalex.org/W2158319614","https://openalex.org/W2295944640","https://openalex.org/W2736425480","https://openalex.org/W2767528495","https://openalex.org/W2962840996","https://openalex.org/W2963054067","https://openalex.org/W3037787799"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W4302939663","https://openalex.org/W2138987445","https://openalex.org/W1842018596"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"the":[5,26,36,42,56],"use":[6],"of":[7,17],"Minimum":[8],"Spanning":[9],"Tree-based":[10],"clustering":[11,32],"to":[12,51],"recursively":[13],"cluster":[14],"large":[15],"sets":[16],"potentially":[18],"Pareto-optimal":[19],"solutions.":[20],"We":[21],"present":[22],"preliminary":[23],"results":[24],"for":[25],"multiobjective":[27],"traveling":[28],"salesperson":[29],"problem.":[30],"The":[31],"is":[33],"based":[34],"on":[35],"distances":[37],"between":[38],"solutions":[39],"defined":[40,53],"in":[41,55],"decision":[43],"space":[44],"but":[45],"it":[46],"generates":[47],"clusters":[48],"that":[49],"correspond":[50],"clearly":[52],"regions":[54],"objective":[57],"space.":[58]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}