{"id":"https://openalex.org/W3216881728","doi":"https://doi.org/10.1007/s10898-021-01109-9","title":"An approximation algorithm for multi-objective optimization problems using a box-coverage","display_name":"An approximation algorithm for multi-objective optimization problems using a box-coverage","publication_year":2021,"publication_date":"2021-11-24","ids":{"openalex":"https://openalex.org/W3216881728","doi":"https://doi.org/10.1007/s10898-021-01109-9","mag":"3216881728"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-021-01109-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01109-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01109-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01109-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["Technische Universit\u00e4t Ilmenau, P.O. Box 10 05 65, 98684, Ilmenau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1938-6316","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, P.O. Box 10 05 65, 98684, Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090014256","display_name":"Leo Warnow","orcid":"https://orcid.org/0000-0002-2177-8466"},"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":true,"raw_author_name":"Leo Warnow","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, P.O. Box 10 05 65, 98684, Ilmenau, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2177-8466","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, P.O. Box 10 05 65, 98684, Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090014256"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2780},"fwci":1.5924,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.85970636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"83","issue":"2","first_page":"329","last_page":"357"},"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"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/polyhedron","display_name":"Polyhedron","score":0.8655210733413696},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6836179494857788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6739716529846191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6246663331985474},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5792118906974792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5371798276901245},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4736422598361969},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.42877334356307983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2872401773929596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18373221158981323}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8655210733413696},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6836179494857788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6739716529846191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6246663331985474},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5792118906974792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5371798276901245},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4736422598361969},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.42877334356307983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2872401773929596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18373221158981323},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10898-021-01109-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01109-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01109-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jglopt:v:83:y:2022:i:2:d:10.1007_s10898-021-01109-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10898-021-01109-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:econstor.eu:10419/287346","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/287346","pdf_url":null,"source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"","raw_type":"doc-type:article"},{"id":"pmh:oai:www.db-thueringen.de:dbt_mods_00055652","is_oa":true,"landing_page_url":"https://www.db-thueringen.de/receive/dbt_mods_00055652","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10898-021-01109-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-021-01109-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-021-01109-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3608464288","display_name":null,"funder_award_id":"Project-ID 432218631","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8031306723","display_name":"Gemischtganzzahlige nichtlineare multikriterielle Optimierung","funder_award_id":"432218631","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3216881728.pdf","grobid_xml":"https://content.openalex.org/works/W3216881728.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W264036554","https://openalex.org/W1558919105","https://openalex.org/W1582299569","https://openalex.org/W1607104331","https://openalex.org/W1970285178","https://openalex.org/W1974080590","https://openalex.org/W1980012026","https://openalex.org/W1988390667","https://openalex.org/W1989707854","https://openalex.org/W1995978080","https://openalex.org/W2008499862","https://openalex.org/W2012902555","https://openalex.org/W2019792531","https://openalex.org/W2023119259","https://openalex.org/W2043947065","https://openalex.org/W2048944090","https://openalex.org/W2058329377","https://openalex.org/W2064823886","https://openalex.org/W2069372244","https://openalex.org/W2072884775","https://openalex.org/W2078040808","https://openalex.org/W2087591761","https://openalex.org/W2091290449","https://openalex.org/W2109880321","https://openalex.org/W2116976433","https://openalex.org/W2119401655","https://openalex.org/W2121365620","https://openalex.org/W2132406365","https://openalex.org/W2143185749","https://openalex.org/W2155479334","https://openalex.org/W2321437985","https://openalex.org/W2478963760","https://openalex.org/W2531315337","https://openalex.org/W2615258659","https://openalex.org/W2621424259","https://openalex.org/W2740941491","https://openalex.org/W2804784253","https://openalex.org/W2917322038","https://openalex.org/W2946045250","https://openalex.org/W2951669098","https://openalex.org/W3014168834","https://openalex.org/W3124460525","https://openalex.org/W3130355952","https://openalex.org/W6601324878"],"related_works":["https://openalex.org/W4382602924","https://openalex.org/W2522715116","https://openalex.org/W2952635969","https://openalex.org/W1967096152","https://openalex.org/W2323914380","https://openalex.org/W1983767262","https://openalex.org/W3102517575","https://openalex.org/W4390137086","https://openalex.org/W2947386998","https://openalex.org/W2111959026"],"abstract_inverted_index":{"Abstract":[0],"For":[1,27,67],"a":[2,11,30,51,70,73,89,100,127,140],"continuous":[3],"multi-objective":[4],"optimization":[5],"problem,":[6],"it":[7],"is":[8,33,48,72,76,131,135],"usually":[9],"not":[10,77,120],"practical":[12],"approach":[13,32,47,112],"to":[14,34,49,79,118,137],"compute":[15,35,99],"all":[16],"its":[17],"nondominated":[18,40,56,104,129],"points":[19],"because":[20],"there":[21],"are":[22,62],"infinitely":[23],"many":[24],"of":[25,38,102,143],"them.":[26],"this":[28,46,82],"reason,":[29],"typical":[31],"an":[36,86,111],"approximation":[37,87],"the":[39,55,93,103],"set.":[41,57,105],"A":[42],"common":[43],"technique":[44],"for":[45,64],"generate":[50],"polyhedron":[52,71],"which":[53],"contains":[54],"However,":[58],"often":[59],"these":[60],"approximations":[61],"used":[63],"further":[65],"evaluations.":[66],"those":[68],"applications":[69],"structure":[74,91],"that":[75],"easy":[78],"handle.":[80],"In":[81,96],"paper,":[83],"we":[84,98,109],"introduce":[85],"with":[88,139],"simpler":[90],"respecting":[92],"natural":[94],"ordering.":[95],"particular,":[97],"box-coverage":[101],"To":[106],"do":[107],"so,":[108],"use":[110],"that,":[113],"in":[114],"general,":[115],"allows":[116],"us":[117],"update":[119],"only":[121],"one":[122],"but":[123],"several":[124],"boxes":[125],"whenever":[126],"new":[128],"point":[130],"found.":[132],"The":[133],"algorithm":[134],"guaranteed":[136],"stop":[138],"finite":[141],"number":[142],"boxes,":[144],"each":[145],"being":[146],"sufficiently":[147],"thin.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}