{"id":"https://openalex.org/W2621424259","doi":"https://doi.org/10.1137/16m1083967","title":"A New Scalarization Technique and New Algorithms to Generate Pareto Fronts","display_name":"A New Scalarization Technique and New Algorithms to Generate Pareto Fronts","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2621424259","doi":"https://doi.org/10.1137/16m1083967","mag":"2621424259"},"language":"en","primary_location":{"id":"doi:10.1137/16m1083967","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1083967","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5075925642","display_name":"Regina S. Burachik","orcid":"https://orcid.org/0000-0003-1332-6213"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. S. Burachik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077751365","display_name":"C. Yal\u00e7\u0131n Kaya","orcid":"https://orcid.org/0000-0001-7962-7153"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Y. Kaya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033232316","display_name":"M. M. Rizvi","orcid":"https://orcid.org/0000-0001-9165-658X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. M. Rizvi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9141,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.87319761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"27","issue":"2","first_page":"1010","last_page":"1034"},"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.9998999834060669,"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.9998999834060669,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9940999746322632,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.7572681903839111},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6749298572540283},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6561480760574341},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5747998952865601},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5671695470809937},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5657134652137756},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5093499422073364},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.49193406105041504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36018460988998413},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0638141930103302}],"concepts":[{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.7572681903839111},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6749298572540283},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6561480760574341},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5747998952865601},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5671695470809937},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5657134652137756},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5093499422073364},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.49193406105041504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36018460988998413},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0638141930103302},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m1083967","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1083967","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:vital:19543","is_oa":false,"landing_page_url":"http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/201524","pdf_url":null,"source":{"id":"https://openalex.org/S4306400234","display_name":"FedUni ResearchOnline (Federation University Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210158496","host_organization_name":"Australian Federation of University Women \u2013 South Australia","host_organization_lineage":["https://openalex.org/I4210158496"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:urm_publish:9916135197801831","is_oa":false,"landing_page_url":"https://hdl.handle.net/11541.2/127016","pdf_url":null,"source":{"id":"https://openalex.org/S4306402528","display_name":"UniSA Research Outputs Repository (University of South Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I170239107","host_organization_name":"University of South Australia","host_organization_lineage":["https://openalex.org/I170239107"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W596285643","https://openalex.org/W641771830","https://openalex.org/W999416671","https://openalex.org/W1561610472","https://openalex.org/W1585268704","https://openalex.org/W1965381995","https://openalex.org/W1968496192","https://openalex.org/W1969872429","https://openalex.org/W1975258684","https://openalex.org/W1975557593","https://openalex.org/W1987995897","https://openalex.org/W1988390667","https://openalex.org/W1997188340","https://openalex.org/W2005596987","https://openalex.org/W2008499862","https://openalex.org/W2022908021","https://openalex.org/W2024008934","https://openalex.org/W2030435702","https://openalex.org/W2034425273","https://openalex.org/W2075220263","https://openalex.org/W2078040808","https://openalex.org/W2091290449","https://openalex.org/W2091687288","https://openalex.org/W2110373411","https://openalex.org/W2123871098","https://openalex.org/W2133629341"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W2001591765","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W1588199609","https://openalex.org/W2744462909","https://openalex.org/W1971520370","https://openalex.org/W1550055091"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,76,159,165],"new":[3,19,29,67,125,183],"scalarization":[4,20,68,73],"technique":[5,69],"for":[6,31,50],"nonconvex":[7],"multiobjective":[8],"optimization":[9,43],"problems":[10,51],"and":[11,41,70,94,122,139,145],"establish":[12],"its":[13],"theoretical":[14],"properties.":[15],"By":[16],"combining":[17],"our":[18,182],"approach":[21,184],"with":[22,52,75,174],"existing":[23,72,132],"grid":[24,77,109],"generation":[25,114],"techniques,":[26],"we":[27],"design":[28,172],"algorithms":[30,46,60,98,126],"constructing":[32,142],"reliable":[33],"approximations":[34],"of":[35,39,78,85,104,136,148,181],"the":[36,66,82,105,108,111,143,146,149,179],"Pareto":[37,150,162],"fronts":[38],"three-":[40],"four-objective":[42],"problems.":[44],"Our":[45],"can":[47],"be":[48],"extended":[49],"more":[53,97],"objective":[54,176],"functions":[55,177],"to":[56,92,128],"minimize.":[57],"Four":[58,96],"three-objective":[59],"are":[61,99,154],"formed":[62],"by":[63,101,119],"pairing":[64],"up":[65],"three":[71],"techniques":[74],"weights":[79],"generated":[80],"over":[81],"convex":[83],"hull":[84],"individual":[86],"minima":[87],"(the":[88,116],"CHIM":[89,106],"grid)":[90,118],"due":[91],"Das":[93],"Dennis.":[95],"obtained":[100],"using,":[102],"instead":[103],"grid,":[107],"in":[110,134,141,156,167],"successive":[112],"boundary":[113,144],"algorithm":[115],"SBG":[117],"Mueller-Gritschneder,":[120],"Graeb,":[121],"Schlichtmann.":[123],"The":[124,152],"seem":[127],"perform":[129],"better":[130],"than":[131],"algorithms,":[133],"terms":[135],"computational":[137],"time":[138],"accuracy":[140],"interior":[147],"front.":[151],"advantages":[153],"tested,":[155],"particular,":[157],"through":[158],"problem":[160,173],"whose":[161],"front":[163],"has":[164],"hole":[166],"it.":[168],"A":[169],"rocket":[170],"injector":[171],"four":[175],"illustrates":[178],"effectiveness":[180],"further.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2017-06-15T00:00:00"}