{"id":"https://openalex.org/W2902917605","doi":"https://doi.org/10.1007/s10288-018-0394-2","title":"An exact algorithm for the minimum quartet tree cost problem","display_name":"An exact algorithm for the minimum quartet tree cost problem","publication_year":2018,"publication_date":"2018-11-26","ids":{"openalex":"https://openalex.org/W2902917605","doi":"https://doi.org/10.1007/s10288-018-0394-2","mag":"2902917605"},"language":"en","primary_location":{"id":"doi:10.1007/s10288-018-0394-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-018-0394-2","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4OR","raw_type":"journal-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/A5029063875","display_name":"Sergio Consoli","orcid":"https://orcid.org/0000-0001-7357-5858"},"institutions":[{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sergio Consoli","raw_affiliation_strings":["Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","Philips Research, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"Philips Research, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032467722","display_name":"Jan Korst","orcid":"https://orcid.org/0000-0002-5789-6165"},"institutions":[{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jan Korst","raw_affiliation_strings":["Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","Philips Research, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"Philips Research, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056442086","display_name":"Gijs Geleijnse","orcid":"https://orcid.org/0000-0002-0947-8970"},"institutions":[{"id":"https://openalex.org/I4210142067","display_name":"Netherlands Comprehensive Cancer Organisation","ror":"https://ror.org/03g5hcd33","country_code":"NL","type":"healthcare","lineage":["https://openalex.org/I4210142067"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gijs Geleijnse","raw_affiliation_strings":["Netherlands Comprehensive Cancer Organisation (IKNL), Zernikestraat 29, 5612 HZ, Eindhoven, The Netherlands","Netherlands Comprehensive Cancer Organisation (IKNL), Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Netherlands Comprehensive Cancer Organisation (IKNL), Zernikestraat 29, 5612 HZ, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210142067"]},{"raw_affiliation_string":"Netherlands Comprehensive Cancer Organisation (IKNL), Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210142067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088562570","display_name":"Steffen Pauws","orcid":"https://orcid.org/0000-0003-2257-9239"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]},{"id":"https://openalex.org/I4210122849","display_name":"Philips (Netherlands)","ror":"https://ror.org/02p2bgp27","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210122849"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Steffen Pauws","raw_affiliation_strings":["Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","TiCC, Tilburg University, Warandelaan 2, 5037 AB, Tilburg, The Netherlands","Philips Research, Eindhoven, The Netherlands","TiCC, Tilburg University, Tilburg, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Philips Research, High Tech Campus 34, 5656 AE, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"TiCC, Tilburg University, Warandelaan 2, 5037 AB, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"Philips Research, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210122849"]},{"raw_affiliation_string":"TiCC, Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029063875"],"corresponding_institution_ids":["https://openalex.org/I4210122849"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.1692,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62027575,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"401","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9940000176429749,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9939000010490417,"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/heuristics","display_name":"Heuristics","score":0.6937643885612488},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5760568976402283},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5304595232009888},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5207036137580872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5178849697113037},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5161717534065247},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.47485923767089844},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.4645765721797943},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45626285672187805},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.44910335540771484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44057175517082214},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.41643181443214417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4104158878326416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41009005904197693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4073562026023865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4018024206161499},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.135758638381958}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6937643885612488},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5760568976402283},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5304595232009888},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5207036137580872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5178849697113037},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5161717534065247},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.47485923767089844},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4645765721797943},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45626285672187805},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.44910335540771484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44057175517082214},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.41643181443214417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4104158878326416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41009005904197693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4073562026023865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4018024206161499},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.135758638381958},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10288-018-0394-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-018-0394-2","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"4OR","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/bf03c477-9681-4650-a3ac-7a42bce4170d","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/bf03c477-9681-4650-a3ac-7a42bce4170d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Consoli, S, Korst, J, Geleijnse, G & Pauws, S 2019, 'An exact algorithm for the minimum quartet tree cost problem', 4or-A quarterly journal of operations research, vol. 17, no. 4, pp. 401-425. https://doi.org/10.1007/s10288-018-0394-2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:aqjoor:v:17:y:2019:i:4:d:10.1007_s10288-018-0394-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10288-018-0394-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"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/W1633532382","https://openalex.org/W1638203394","https://openalex.org/W1970247791","https://openalex.org/W2017739727","https://openalex.org/W2057017040","https://openalex.org/W2062984219","https://openalex.org/W2075503802","https://openalex.org/W2076185706","https://openalex.org/W2086888493","https://openalex.org/W2100126548","https://openalex.org/W2102424972","https://openalex.org/W2128859735","https://openalex.org/W2143259515","https://openalex.org/W2147390984","https://openalex.org/W2164411384","https://openalex.org/W2165897980","https://openalex.org/W2284236737","https://openalex.org/W2798588639","https://openalex.org/W3124783963","https://openalex.org/W4214740339","https://openalex.org/W4230960895"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1585318792","https://openalex.org/W28092394","https://openalex.org/W1970145791"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}