{"id":"https://openalex.org/W3083622237","doi":"https://doi.org/10.1016/j.dam.2020.08.012","title":"A linear time algorithm for the robust recoverable selection problem","display_name":"A linear time algorithm for the robust recoverable selection problem","publication_year":2020,"publication_date":"2020-09-06","ids":{"openalex":"https://openalex.org/W3083622237","doi":"https://doi.org/10.1016/j.dam.2020.08.012","mag":"3083622237"},"language":"en","primary_location":{"id":"doi:10.1016/j.dam.2020.08.012","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2020.08.012","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.dam.2020.08.012","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046538461","display_name":"Thomas Lachmann","orcid":"https://orcid.org/0000-0003-1253-8003"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thomas Lachmann","raw_affiliation_strings":["Institute of Financial Mathematics and Applied Number Theory, JKU Linz, Austria"],"raw_orcid":"https://orcid.org/0000-0003-1253-8003","affiliations":[{"raw_affiliation_string":"Institute of Financial Mathematics and Applied Number Theory, JKU Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065168862","display_name":"Stefan Lendl","orcid":"https://orcid.org/0000-0002-5660-5397"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Stefan Lendl","raw_affiliation_strings":["Institute of Discrete Mathematics, TU Graz, Austria"],"raw_orcid":"https://orcid.org/0000-0002-5660-5397","affiliations":[{"raw_affiliation_string":"Institute of Discrete Mathematics, TU Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8816-2693","affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065168862"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.5573,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72153203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"303","issue":null,"first_page":"94","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7284820079803467},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6785039901733398},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6407566070556641},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6052076816558838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5611032247543335},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5518961548805237},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5326414108276367},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4617491066455841},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4485699236392975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23096752166748047},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09912803769111633}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7284820079803467},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6785039901733398},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6407566070556641},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6052076816558838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5611032247543335},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5518961548805237},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5326414108276367},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4617491066455841},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4485699236392975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23096752166748047},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09912803769111633},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.dam.2020.08.012","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2020.08.012","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.dam.2020.08.012","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2020.08.012","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4135731702","display_name":null,"funder_award_id":"W1230","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6833819346","display_name":null,"funder_award_id":"Y-901","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G7289743613","display_name":null,"funder_award_id":"F5505-N26","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1636491287","https://openalex.org/W1963888335","https://openalex.org/W1996641400","https://openalex.org/W2034844194","https://openalex.org/W2107423006","https://openalex.org/W2139594840","https://openalex.org/W2418396476","https://openalex.org/W2469064012","https://openalex.org/W2482469685","https://openalex.org/W2490573886","https://openalex.org/W2582184501","https://openalex.org/W2614696754","https://openalex.org/W2962359742","https://openalex.org/W2963875387","https://openalex.org/W4288284074","https://openalex.org/W6636543980","https://openalex.org/W6721774119"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W4390579151","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2900627138"],"abstract_inverted_index":{"The":[0,26,45],"feasible":[1,32],"solutions":[2],"in":[3,34,51],"the":[4,52],"robust":[5],"recoverable":[6],"selection":[7],"problem":[8,50],"are":[9,15],"subsets":[10],"of":[11,23],"size":[12,24],"p":[13],"that":[14],"to":[16,29,55],"be":[17],"selected":[18],"from":[19],"a":[20,31],"ground":[21],"set":[22],"n.":[25],"objective":[27],"is":[28],"construct":[30],"solution":[33],"two":[35,39],"sequential":[36],"stages":[37],"with":[38,69],"separate":[40],"(but":[41],"interleaved)":[42],"cost":[43],"structures.":[44],"fastest":[46],"algorithm":[47,68],"for":[48],"this":[49,64],"literature":[53],"up":[54],"now":[56],"has":[57],"quadratic":[58],"running":[59,71],"time.":[60,72],"We":[61],"improve":[62],"on":[63],"by":[65],"developing":[66],"an":[67],"linear":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}