{"id":"https://openalex.org/W2804784253","doi":"https://doi.org/10.1137/18m1169680","title":"A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization","display_name":"A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2804784253","doi":"https://doi.org/10.1137/18m1169680","mag":"2804784253"},"language":"en","primary_location":{"id":"doi:10.1137/18m1169680","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1169680","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/A5075680709","display_name":"Julia Niebling","orcid":"https://orcid.org/0000-0001-5413-2234"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Julia Niebling","raw_affiliation_strings":["Institute for Mathematics, Technische Universit\u00e4t Ilmenau, Po 10 05 65, D-98684 Ilmenau, Germany,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematics, Technische Universit\u00e4t Ilmenau, Po 10 05 65, D-98684 Ilmenau, Germany,","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020142332","display_name":"Gabriele Eichfelder","orcid":"https://orcid.org/0000-0002-1938-6316"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Gabriele Eichfelder","raw_affiliation_strings":["Institute for Mathematics, Technische Universit\u00e4t Ilmenau, Po 10 05 65, D-98684 Ilmenau, Germany,"],"raw_orcid":"https://orcid.org/0000-0002-1938-6316","affiliations":[{"raw_affiliation_string":"Institute for Mathematics, Technische Universit\u00e4t Ilmenau, Po 10 05 65, D-98684 Ilmenau, Germany,","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":5.2059,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95907868,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"794","last_page":"821"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/mathematics","display_name":"Mathematics","score":0.6976334452629089},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6945398449897766},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6659218668937683},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49637848138809204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49101924896240234},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48376989364624023},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47950083017349243},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46211129426956177},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4356034994125366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24091234803199768}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6976334452629089},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6945398449897766},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6659218668937683},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49637848138809204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49101924896240234},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48376989364624023},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47950083017349243},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46211129426956177},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4356034994125366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24091234803199768},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1169680","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1169680","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:oai:www.db-thueringen.de:dbt_mods_00034242","is_oa":false,"landing_page_url":"https://www.db-thueringen.de/receive/dbt_mods_00034242","pdf_url":null,"source":{"id":"https://openalex.org/S4306400120","display_name":"Common Library Network (Der Gemeinsame Bibliotheksverbund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210149878","host_organization_name":"Verbundzentrale des GBV","host_organization_lineage":["https://openalex.org/I4210149878"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309895","display_name":"Carl-Zeiss-Stiftung","ror":"https://ror.org/03ng4kg22"},{"id":"https://openalex.org/F4320313454","display_name":"Bergische Universit\u00e4t Wuppertal","ror":"https://ror.org/00613ak93"},{"id":"https://openalex.org/F4320313941","display_name":"Friedrich-Schiller-Universit\u00e4t Jena","ror":"https://ror.org/05qpz1x62"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324722","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W162069171","https://openalex.org/W251973404","https://openalex.org/W615245433","https://openalex.org/W1530501119","https://openalex.org/W1971893679","https://openalex.org/W1984425167","https://openalex.org/W1986778884","https://openalex.org/W2005596987","https://openalex.org/W2012902555","https://openalex.org/W2023119259","https://openalex.org/W2024752222","https://openalex.org/W2032761626","https://openalex.org/W2033779436","https://openalex.org/W2037534711","https://openalex.org/W2045376744","https://openalex.org/W2048944090","https://openalex.org/W2050358508","https://openalex.org/W2058329377","https://openalex.org/W2066129260","https://openalex.org/W2080752182","https://openalex.org/W2081411394","https://openalex.org/W2087591761","https://openalex.org/W2113741278","https://openalex.org/W2126105956","https://openalex.org/W2152551290","https://openalex.org/W2270168262","https://openalex.org/W2531315337","https://openalex.org/W2739418669","https://openalex.org/W2766184124","https://openalex.org/W2793548751","https://openalex.org/W2962794963","https://openalex.org/W3101838719","https://openalex.org/W3102304083"],"related_works":["https://openalex.org/W2121314695","https://openalex.org/W2571293944","https://openalex.org/W2087596644","https://openalex.org/W1586564767","https://openalex.org/W2003581559","https://openalex.org/W2589063463","https://openalex.org/W2070184056","https://openalex.org/W2071235713","https://openalex.org/W1931163646","https://openalex.org/W2031202609"],"abstract_inverted_index":{"A":[0],"new":[1],"branch--and--bound-based":[2],"algorithm":[3,16,110],"for":[4],"smooth":[5],"nonconvex":[6],"multiobjective":[7,93,105],"optimization":[8,87,95],"problems":[9],"with":[10,88],"convex":[11,94],"constraints":[12],"is":[13],"presented.":[14],"The":[15,39],"computes":[17],"a":[18,54,73],"so-called":[19],"$(\\varepsilon,\\delta)$-efficient":[20],"set":[21],"of":[22,68,99],"all":[23],"globally":[24],"optimal":[25,58],"solutions.":[26],"We":[27,71,107],"introduce":[28],"the":[29,43,64,69,80,97,109],"algorithm,":[30],"which":[31,76],"uses":[32],"selection":[33],"rules,":[34],"discarding,":[35],"and":[36,60,66,96],"termination":[37],"tests.":[38],"discarding":[40,74],"tests":[41],"are":[42],"most":[44],"important":[45],"aspect,":[46],"as":[47,115,117],"they":[48],"examine":[49],"in":[50,121],"different":[51],"ways":[52],"whether":[53],"box":[55],"can":[56],"contain":[57],"solutions":[59],"determine":[61],"by":[62],"that":[63],"speed":[65],"effectiveness":[67],"algorithm.":[70],"present":[72],"test":[75,113],"combines":[77],"techniques":[78,91],"from":[79,83,92,103],"$\\alpha$BB":[81],"method":[82],"global":[84],"single":[85],"objective":[86],"outer":[89],"approximation":[90],"concept":[98],"local":[100],"upper":[101],"bounds":[102],"combinatorial":[104],"optimization.":[106],"apply":[108],"to":[111,118],"several":[112],"instances":[114],"well":[116],"an":[119],"application":[120],"Lorentz":[122],"force":[123],"velocimetry.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}