{"id":"https://openalex.org/W2886168451","doi":"https://doi.org/10.1080/02331934.2020.1737692","title":"Inner approximation algorithm for solving linear multiobjective optimization problems","display_name":"Inner approximation algorithm for solving linear multiobjective optimization problems","publication_year":2020,"publication_date":"2020-03-10","ids":{"openalex":"https://openalex.org/W2886168451","doi":"https://doi.org/10.1080/02331934.2020.1737692","mag":"2886168451"},"language":"en","primary_location":{"id":"doi:10.1080/02331934.2020.1737692","doi":"https://doi.org/10.1080/02331934.2020.1737692","is_oa":true,"landing_page_url":"https://doi.org/10.1080/02331934.2020.1737692","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/02331934.2020.1737692?needAccess=true","source":{"id":"https://openalex.org/S158016561","display_name":"Optimization","issn_l":"0233-1934","issn":["0233-1934","1026-7662","1029-4945"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-c","anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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":"Optimization","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/02331934.2020.1737692?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090277124","display_name":"L\u00e1szl\u00f3 Csirmaz","orcid":"https://orcid.org/0000-0001-7530-8307","observed_orcids":["https://orcid.org/0000-0001-7530-8307"]},"institutions":[{"id":"https://openalex.org/I4387153749","display_name":"Central European University - Budapest Campus","ror":"https://ror.org/02s3xwp33","country_code":"HU","type":"education","lineage":["https://openalex.org/I198945027","https://openalex.org/I4387153749"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Laszlo Csirmaz","raw_affiliation_strings":["Central European University, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Central European University, Budapest, Hungary","institution_ids":["https://openalex.org/I4387153749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090277124"],"corresponding_institution_ids":["https://openalex.org/I4387153749"],"apc_list":null,"apc_paid":null,"fwci":0.9942,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.72912739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"70","issue":"7","first_page":"1487","last_page":"1511"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.6333000063896179,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.6333000063896179,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.20309999585151672,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.07919999957084656,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-enumeration","display_name":"vertex enumeration","score":0.9269999861717224},{"id":"https://openalex.org/keywords/degenerate-problems","display_name":"degenerate problems","score":0.7590000033378601},{"id":"https://openalex.org/keywords/pareto-front-approximation","display_name":"Pareto front approximation","score":0.38100001215934753}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6380123496055603},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5886406898498535},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5444352626800537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5208011865615845},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47888821363449097},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43735620379447937},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42123350501060486},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4129423201084137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4092016816139221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12588819861412048},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09854215383529663}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/02331934.2020.1737692","doi":"https://doi.org/10.1080/02331934.2020.1737692","is_oa":true,"landing_page_url":"https://doi.org/10.1080/02331934.2020.1737692","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/02331934.2020.1737692?needAccess=true","source":{"id":"https://openalex.org/S158016561","display_name":"Optimization","issn_l":"0233-1934","issn":["0233-1934","1026-7662","1029-4945"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-c","anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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":"Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1808.01786","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1808.01786","pdf_url":"https://arxiv.org/pdf/1808.01786","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"mag:2886168451","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1808.01786v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:openresearch.ceu.edu:20.500.14018/13851","doi":null,"is_oa":true,"landing_page_url":"https://openresearch.ceu.edu/bitstreams/e58a954c-e96e-482b-8700-ab88b52a29fc/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401981","display_name":"Open Research (Auckland University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I39854758","host_organization_name":"Auckland University of Technology","host_organization_lineage":["https://openalex.org/I39854758"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization","raw_type":"Journal article"},{"id":"doi:10.48550/arxiv.1808.01786","doi":"https://doi.org/10.48550/arxiv.1808.01786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1808.01786","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1080/02331934.2020.1737692","doi":"https://doi.org/10.1080/02331934.2020.1737692","is_oa":true,"landing_page_url":"https://doi.org/10.1080/02331934.2020.1737692","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/02331934.2020.1737692?needAccess=true","source":{"id":"https://openalex.org/S158016561","display_name":"Optimization","issn_l":"0233-1934","issn":["0233-1934","1026-7662","1029-4945"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-c","anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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":"Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5816440986","display_name":"Conditional independence structures: combinatorial and optimization methods","funder_award_id":"GA16-12010S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2886168451.pdf","grobid_xml":"https://content.openalex.org/works/W2886168451.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1526262508","https://openalex.org/W1582575444","https://openalex.org/W1597196612","https://openalex.org/W1655314000","https://openalex.org/W1983281982","https://openalex.org/W2034443872","https://openalex.org/W2048944090","https://openalex.org/W2054372248","https://openalex.org/W2146483477","https://openalex.org/W2150673362","https://openalex.org/W2187847034","https://openalex.org/W2212241622","https://openalex.org/W2218652040","https://openalex.org/W2254347213","https://openalex.org/W2294556753","https://openalex.org/W2522706662","https://openalex.org/W2792197217","https://openalex.org/W2811152840","https://openalex.org/W4206570602","https://openalex.org/W4234356172"],"related_works":["https://openalex.org/W7099833256","https://openalex.org/W2119195793","https://openalex.org/W2054372248","https://openalex.org/W3181368311","https://openalex.org/W2146483477","https://openalex.org/W90641487","https://openalex.org/W3205636198","https://openalex.org/W7105897877","https://openalex.org/W7201961922","https://openalex.org/W4287251263"],"abstract_inverted_index":{"Benson's":[0,50,87,108],"outer":[1],"approximation":[2,110],"algorithm":[3,88,99],"and":[4,31,52,96,166],"its":[5],"variants":[6],"are":[7,61,134],"the":[8,41,66,90,97,139,161,167],"most":[9],"frequently":[10],"used":[11],"methods":[12],"for":[13,112],"solving":[14],"linear":[15,26,115,136],"multiobjective":[16],"optimization":[17,27,72],"problems.":[18],"These":[19],"algorithms":[20,60],"have":[21],"two":[22],"intertwined":[23],"parts:":[24],"single-objective":[25,71],"on":[28,40,65],"one":[29],"hand,":[30],"a":[32,46,55,79,150],"combinatorial":[33,67,169],"part":[34],"closely":[35],"related":[36],"to":[37,127,156,160],"vertex":[38],"enumeration":[39],"other.":[42],"Their":[43],"separation":[44],"provides":[45],"deeper":[47],"insight":[48],"into":[49],"algorithm,":[51,83],"points":[53],"toward":[54],"dual":[56,98,105],"approach.":[57],"Two":[58],"skeletal":[59],"defined":[62],"which":[63],"focus":[64],"part.":[68],"Using":[69],"different":[70,75],"problems":[73,131,142],"yields":[74],"algorithms,":[76],"such":[77],"as":[78],"sequential":[80],"convex":[81],"hull":[82],"another":[84],"version":[85,123],"of":[86,100,107,164],"with":[89,143],"theoretically":[91],"best":[92],"possible":[93],"iteration":[94],"count,":[95],"Ehrgott":[101],"et":[102],"al.":[103],"[A":[104],"variant":[106],"\u2018outer":[109],"algorithm\u2019":[111],"multiple":[113],"objective":[114],"programming.":[116],"J":[117],"Glob":[118],"Optim.":[119],"2012;52:757\u2013778].":[120],"The":[121],"implemented":[122],"is":[124],"well":[125],"suited":[126],"handle":[128],"highly":[129],"degenerate":[130],"where":[132],"there":[133],"many":[135],"dependencies":[137],"among":[138],"constraints.":[140],"On":[141],"10":[144],"or":[145],"more":[146],"objectives,":[147],"it":[148],"shows":[149],"significant":[151],"increase":[152],"in":[153],"efficiency":[154],"compared":[155],"Bensolve":[157],"\u2013":[158],"due":[159],"reduced":[162],"number":[163],"iterations":[165],"improved":[168],"handling.":[170]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2018-08-22T00:00:00"}