{"id":"https://openalex.org/W6921958511","doi":"https://doi.org/10.7916/d80k2gr9","title":"Approximation of Multiobjective Optimization Problems","display_name":"Approximation of Multiobjective Optimization Problems","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W6921958511","doi":"https://doi.org/10.7916/d80k2gr9"},"language":"en","primary_location":{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D80K2GR9","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D80K2GR9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Theses"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.7916/d80k2gr9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Diakonikolas, Ilias","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Diakonikolas, Ilias","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.42573651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9689000248908997,"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.9689000248908997,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.00930000003427267,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00430000014603138,"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/set","display_name":"Set (abstract data type)","score":0.3765999972820282},{"id":"https://openalex.org/keywords/nucleofection","display_name":"Nucleofection","score":0.29330000281333923},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.29269999265670776},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.2615000009536743},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.24539999663829803},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.23980000615119934}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C144251240","wikidata":"https://www.wikidata.org/wiki/Q7068229","display_name":"Nucleofection","level":4,"score":0.29330000281333923},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.24539999663829803},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.23980000615119934},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.23899999260902405},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.23649999499320984},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.23029999434947968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22789999842643738}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:academiccommons.columbia.edu:10.7916/D80K2GR9","is_oa":false,"landing_page_url":"https://doi.org/10.7916/D80K2GR9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Theses"},{"id":"doi:10.7916/d80k2gr9","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d80k2gr9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.7916/d80k2gr9","is_oa":true,"landing_page_url":"https://doi.org/10.7916/d80k2gr9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402601","display_name":"Columbia Academic Commons (Columbia University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78577930","host_organization_name":"Columbia University","host_organization_lineage":["https://openalex.org/I78577930"],"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":"article-journal"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.587824285030365}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,214,259,313],"study":[1,287],"optimization":[2,141,257],"problems":[3,8,61,142,269],"with":[4,180,198,263],"multiple":[5],"objectives.":[6,78,282],"Such":[7],"are":[9,63],"pervasive":[10],"across":[11],"many":[12,199],"diverse":[13],"disciplines":[14],"--":[15,26],"in":[16,37,40,66,72,158,189,194,381],"economics,":[17],"engineering,":[18],"healthcare,":[19],"biology,":[20],"to":[21,30,118,123,169,175,301,344],"name":[22],"but":[23,71],"a":[24,48,52,67,110,125,155,166,172,227,240,248,255,296,364,382],"few":[25],"and":[27,43,115,270,280,286,323,338,389,394],"heuristic":[28],"approaches":[29],"solve":[31],"them":[32],"have":[33,109],"already":[34],"been":[35,185],"deployed":[36],"several":[38],"areas,":[39,385],"both":[41,335],"academia":[42],"industry.":[44],"Hence,":[45,154],"there":[46],"is":[47,80,100,148,375],"real":[49],"need":[50],"for":[51,139,144,151,202,218,226,267,273,309,336,368],"rigorous":[53],"investigation":[54],"of":[55,90,96,113,127,165,191,222,230,238,243,254,278,290,299,327,347,372,384],"the":[56,73,76,83,88,97,120,128,133,176,186,192,195,219,223,236,251,274,288,291,302,306,310,325,345,349,361,369],"relevant":[57],"questions.":[58],"In":[59],"such":[60,316,386],"we":[62,108,116,234,284,342,359],"interested":[64],"not":[65,101],"single":[68],"optimal":[69],"solution,":[70],"tradeoff":[74,84,121,134],"between":[75],"different":[77,379],"This":[79,183],"captured":[81],"by":[82,103],"or":[85,211],"Pareto":[86,224,252,294,303,333,350],"curve,":[87],"set":[89,225,242,351],"all":[91],"feasible":[92],"solutions":[93,244],"whose":[94],"vector":[95],"various":[98],"objectives":[99,114,146],"dominated":[102],"any":[104,208],"other":[105],"solution.":[106],"Typically,":[107],"small":[111],"number":[112],"wish":[117],"plot":[119],"curve":[122,135,253],"get":[124],"sense":[126],"design":[129],"space.":[130],"Unfortunately,":[131],"typically":[132,149,205],"has":[136,184],"exponential":[137],"size":[138,330],"discrete":[140,337],"even":[143],"two":[145],"(and":[147],"infinite":[150],"continuous":[152],"problems).":[153],"natural":[156],"goal":[157,188],"this":[159,203,357],"setting":[160],"is,":[161],"given":[162],"an":[163,317],"instance":[164],"multiobjective":[167,196,231,256,388],"problem,":[168],"efficiently":[170,321,353],"obtain":[171],"``good''":[173],"approximation":[174,221,261,300,318,371],"entire":[177],"solution":[178],"space":[179],"``few''":[181],"solutions.":[182],"underlying":[187],"much":[190],"research":[193],"area,":[197],"heuristics":[200],"proposed":[201],"purpose,":[204],"however":[206],"without":[207],"performance":[209,265],"guarantees":[210,266],"complexity":[212],"analysis.":[213],"develop":[215],"efficient":[216],"algorithms":[217,262],"succinct":[220,370],"large":[228],"class":[229],"problems.":[232,340],"First,":[233],"investigate":[235,324],"problem":[237,326,346],"computing":[239,328],"minimum":[241,329],"that":[245],"approximates":[246],"within":[247],"specified":[249],"accuracy":[250],"problem.":[258],"provide":[260],"tight":[264],"bi-objective":[268],"make":[271],"progress":[272],"more":[275,281],"challenging":[276],"case":[277],"three":[279],"Subsequently,":[283],"propose":[285],"notion":[289,298],"approximate":[292,331],"convex":[293,311,332,339],"set;":[295],"novel":[297],"set,":[304],"as":[305,352,354],"appropriate":[307],"one":[308],"setting.":[312],"characterize":[314],"when":[315],"can":[319],"be":[320],"constructed":[322],"sets,":[334],"Next,":[341],"turn":[343],"approximating":[348],"possible.":[355],"To":[356],"end,":[358],"analyze":[360],"Chord":[362],"algorithm,":[363],"popular,":[365],"simple":[366],"method":[367],"curves,":[373],"which":[374],"widely":[376],"used,":[377],"under":[378],"names,":[380],"variety":[383],"as,":[387],"parametric":[390],"optimization,":[391],"computational":[392],"geometry,":[393],"graphics.":[395]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}