{"id":"https://openalex.org/W4226385637","doi":"https://doi.org/10.1080/03155986.2022.2040274","title":"Approximating the Pareto frontier for a challenging real-world bi-objective covering problem","display_name":"Approximating the Pareto frontier for a challenging real-world bi-objective covering problem","publication_year":2022,"publication_date":"2022-04-08","ids":{"openalex":"https://openalex.org/W4226385637","doi":"https://doi.org/10.1080/03155986.2022.2040274"},"language":"en","primary_location":{"id":"doi:10.1080/03155986.2022.2040274","is_oa":true,"landing_page_url":"https://doi.org/10.1080/03155986.2022.2040274","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/03155986.2022.2040274?needAccess=true","source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/03155986.2022.2040274?needAccess=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087671966","display_name":"Nils\u2010Hassan Quttineh","orcid":"https://orcid.org/0000-0002-9881-4170"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Nils-Hassan Quttineh","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064286308","display_name":"Uledi Ngulo","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Uledi Ngulo","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074200057","display_name":"Torbj\u00f6rn Larsson","orcid":"https://orcid.org/0000-0003-2094-7376"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Torbj\u00f6rn Larsson","raw_affiliation_strings":["Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087671966"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.2922,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56372142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"60","issue":"3","first_page":"342","last_page":"358"},"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.9993000030517578,"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.9993000030517578,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9891999959945679,"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/pareto-principle","display_name":"Pareto principle","score":0.7566853761672974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.733673095703125},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.6959851384162903},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6313679218292236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.612820029258728},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5900716781616211},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.559199333190918},{"id":"https://openalex.org/keywords/frontier","display_name":"Frontier","score":0.5277265310287476},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5254746675491333},{"id":"https://openalex.org/keywords/decision-maker","display_name":"Decision maker","score":0.4690530598163605},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.455514132976532},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.44569140672683716},{"id":"https://openalex.org/keywords/efficient-frontier","display_name":"Efficient frontier","score":0.43784016370773315},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3769868016242981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2615880072116852},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.11253410577774048},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06753382086753845}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7566853761672974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.733673095703125},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.6959851384162903},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6313679218292236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.612820029258728},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5900716781616211},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.559199333190918},{"id":"https://openalex.org/C2778571376","wikidata":"https://www.wikidata.org/wiki/Q1355821","display_name":"Frontier","level":2,"score":0.5277265310287476},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5254746675491333},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.4690530598163605},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.455514132976532},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.44569140672683716},{"id":"https://openalex.org/C51485801","wikidata":"https://www.wikidata.org/wiki/Q16966861","display_name":"Efficient frontier","level":3,"score":0.43784016370773315},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3769868016242981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2615880072116852},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11253410577774048},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06753382086753845},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/03155986.2022.2040274","is_oa":true,"landing_page_url":"https://doi.org/10.1080/03155986.2022.2040274","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/03155986.2022.2040274?needAccess=true","source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:liu-184392","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-184392","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"}],"best_oa_location":{"id":"doi:10.1080/03155986.2022.2040274","is_oa":true,"landing_page_url":"https://doi.org/10.1080/03155986.2022.2040274","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/03155986.2022.2040274?needAccess=true","source":{"id":"https://openalex.org/S155959304","display_name":"INFOR Information Systems and Operational Research","issn_l":"0315-5986","issn":["0315-5986","1916-0615"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOR: Information Systems and Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226385637.pdf","grobid_xml":"https://content.openalex.org/works/W4226385637.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1521316934","https://openalex.org/W1558919105","https://openalex.org/W1964399289","https://openalex.org/W1965268960","https://openalex.org/W2003749640","https://openalex.org/W2036397584","https://openalex.org/W2077721795","https://openalex.org/W2099813847","https://openalex.org/W2317085511"],"related_works":["https://openalex.org/W786816755","https://openalex.org/W2197574022","https://openalex.org/W1993518163","https://openalex.org/W2788195075","https://openalex.org/W1493202049","https://openalex.org/W2052246082","https://openalex.org/W2133350622","https://openalex.org/W2353046421","https://openalex.org/W2064886355","https://openalex.org/W4226385637"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,8,42,64,96,100,105],"bi-objective":[3],"covering":[4,66,76,123],"problem":[5,59,67],"stemming":[6],"from":[7],"real-world":[9],"application":[10,26],"concerning":[11],"the":[12,31,50,53,82,115],"design":[13],"of":[14,52,75],"camera":[15],"surveillance":[16],"systems":[17],"for":[18,85,98,121],"large-scale":[19],"outdoor":[20],"areas.":[21],"It":[22],"is":[23,56,88,112],"in":[24,104],"this":[25],"prohibitively":[27],"costly":[28],"to":[29,37,40],"surveil":[30],"entire":[32],"area,":[33],"and":[34,49,73,92,125],"therefore":[35,94],"necessary":[36],"be":[38,61],"able":[39],"present":[41],"decision-maker":[43],"with":[44,68],"trade-offs":[45],"between":[46],"total":[47],"cost":[48,72],"portion":[51,74],"area":[54],"that":[55,78],"surveilled.":[57],"The":[58,110],"can":[60],"stated":[62],"as":[63],"set":[65,122],"two":[69],"objectives,":[70],"describing":[71],"constraints":[77],"are":[79],"fulfilled.":[80],"Finding":[81],"Pareto":[83],"frontier":[84,103],"these":[86],"objectives":[87],"very":[89],"computationally":[90],"demanding":[91],"we":[93],"derive":[95],"method":[97,111],"finding":[99],"good":[101],"approximate":[102],"practically":[106],"feasible":[107],"computing":[108],"time.":[109],"based":[113],"on":[114],"epsilon-constraint":[116],"reformulation,":[117],"an":[118],"established":[119],"heuristic":[120],"problems,":[124],"subgradient":[126],"optimization.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}