{"id":"https://openalex.org/W2982085030","doi":"https://doi.org/10.1080/10556788.2019.1679142","title":"Integer linear programming formulations for double roman domination problem","display_name":"Integer linear programming formulations for double roman domination problem","publication_year":2019,"publication_date":"2019-10-22","ids":{"openalex":"https://openalex.org/W2982085030","doi":"https://doi.org/10.1080/10556788.2019.1679142","mag":"2982085030"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2019.1679142","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2019.1679142","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","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/A5056868745","display_name":"Qingqiong Cai","orcid":"https://orcid.org/0000-0002-3170-7004"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingqiong Cai","raw_affiliation_strings":["College of Computer Science, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017037570","display_name":"Neng Fan","orcid":"https://orcid.org/0000-0003-4333-3721"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neng Fan","raw_affiliation_strings":["Department of Systems & Industrial Engineering, University of Arizona, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Systems & Industrial Engineering, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062762366","display_name":"Yongtang Shi","orcid":"https://orcid.org/0000-0001-9406-7967"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongtang Shi","raw_affiliation_strings":["Center for Combinatorics and LPMC, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059825876","display_name":"Shunyu Yao","orcid":"https://orcid.org/0000-0002-7314-3067"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shunyu Yao","raw_affiliation_strings":["Center for Combinatorics and LPMC, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Center for Combinatorics and LPMC, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017037570"],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":1.3579,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.83544353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"37","issue":"1","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9908000230789185,"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.9419999718666077,"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/mathematics","display_name":"Mathematics","score":0.7120057940483093},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7073464393615723},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6655869483947754},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6295878291130066},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6201569437980652},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6111170053482056},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46125826239585876},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45644834637641907},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4355873167514801},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4213344156742096},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4013516306877136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28236275911331177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1306297779083252}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7120057940483093},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7073464393615723},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6655869483947754},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6295878291130066},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6201569437980652},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6111170053482056},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46125826239585876},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45644834637641907},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4355873167514801},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4213344156742096},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4013516306877136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28236275911331177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1306297779083252},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2019.1679142","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2019.1679142","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1826320880","display_name":null,"funder_award_id":"19JCQNJC14400","funder_id":"https://openalex.org/F4320323993","funder_display_name":"Natural Science Foundation of Tianjin City"},{"id":"https://openalex.org/G2477784789","display_name":null,"funder_award_id":"11771221","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3071026030","display_name":null,"funder_award_id":"11811540390","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6460628717","display_name":null,"funder_award_id":"17JCQNJC00300","funder_id":"https://openalex.org/F4320323993","funder_display_name":"Natural Science Foundation of Tianjin City"},{"id":"https://openalex.org/G811770733","display_name":null,"funder_award_id":"11701297","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320323993","display_name":"Natural Science Foundation of Tianjin City","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W44600779","https://openalex.org/W788806422","https://openalex.org/W1493071618","https://openalex.org/W1975748865","https://openalex.org/W1984228559","https://openalex.org/W2006503776","https://openalex.org/W2015201000","https://openalex.org/W2019578481","https://openalex.org/W2026300475","https://openalex.org/W2058946695","https://openalex.org/W2073127061","https://openalex.org/W2077326803","https://openalex.org/W2094067618","https://openalex.org/W2105597036","https://openalex.org/W2202070217","https://openalex.org/W2227009375","https://openalex.org/W2337802335","https://openalex.org/W2346913169","https://openalex.org/W2347101574","https://openalex.org/W2744781146","https://openalex.org/W2759838277","https://openalex.org/W2769897350","https://openalex.org/W2790637388","https://openalex.org/W2794674653","https://openalex.org/W2796421782","https://openalex.org/W2796445651","https://openalex.org/W2883391582","https://openalex.org/W2891885186","https://openalex.org/W2933181493","https://openalex.org/W4232896595","https://openalex.org/W4251005761"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W1925942709","https://openalex.org/W4302819359","https://openalex.org/W1963627056","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W1973873435","https://openalex.org/W4232431455"],"abstract_inverted_index":{"For":[0],"a":[1,4,11,151],"graph":[2],"G=(V,E),":[3],"double":[5,62,129],"Roman":[6,63,130],"dominating":[7],"function":[8,12],"(DRDF)":[9],"is":[10,67,79],"f:V\u2192{0,1,2,3}":[13],"having":[14],"the":[15,61,73,122,128,134,141,145,183],"property":[16],"that":[17,77,121],"if":[18,42],"f(v)=0,":[19],"then":[20,44],"vertex":[21,45],"v":[22,46],"must":[23,47],"have":[24,48],"at":[25,34,49],"least":[26,35,50],"two":[27,136],"neighbours":[28],"assigned":[29],"2":[30],"under":[31],"f":[32,75],"or":[33,148],"one":[36,51,90,161],"neighbour":[37,52],"u":[38,53],"with":[39,54,96],"f(u)=3,":[40],"and":[41,89,108,133,156,172],"f(v)=1,":[43],"f(u)\u22652.":[55],"In":[56],"this":[57,102],"paper,":[58],"we":[59,119,159],"consider":[60],"domination":[64,131],"problem,":[65,132],"which":[66],"an":[68,166],"optimization":[69],"problem":[70],"of":[71,99,115,144,150,154],"finding":[72],"DRDF":[74],"such":[76],"\u2211v\u2208Vf(v)":[78],"minimum.":[80],"We":[81],"propose":[82],"five":[83],"integer":[84,92],"linear":[85,93],"programming":[86,94],"(ILP)":[87],"formulations":[88,171],"mixed":[91],"formulation":[95,163],"polynomial":[97],"number":[98,153],"constraints":[100,155],"for":[101,113],"problem.":[103],"Some":[104],"additional":[105],"valid":[106],"inequalities":[107],"bounds":[109],"are":[110,138,175],"also":[111],"proposed":[112,170],"some":[114],"these":[116],"formulations.":[117],"Further,":[118],"prove":[120],"first":[123],"four":[124],"models":[125,137],"indeed":[126],"solve":[127],"last":[135],"equivalent":[139],"to":[140,164,181],"others":[142],"regardless":[143],"variable":[146],"relaxation":[147],"usage":[149],"smaller":[152],"variables.":[157],"Additionally,":[158],"use":[160],"ILP":[162],"give":[165],"H(2(\u0394+1))-approximation":[167],"algorithm.":[168],"All":[169],"approximation":[173],"algorithm":[174],"evaluated":[176],"on":[177],"randomly":[178],"generated":[179],"graphs":[180],"compare":[182],"performance.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}