{"title":"影响覆盖优化问题","authors":"Majid Akhgar, Juan S. Borrero","doi":"10.1080/24725854.2023.2261507","DOIUrl":null,"url":null,"abstract":"AbstractWe introduce the Influence Coverage Optimization Problem (ICOP), which is an influence maximization problem where the activation of nodes also depends on their location on the plane. Specifically, the ICOP assumes that there is a network where nodes become active (i.e., influenced) either by the influence they receive from interactions with active in-neighbors or by entering the coverage area of a physical ad or a Geo-fence. The objective is to locate a fixed number of ads or Geo-fences and modify the network influence rates to minimize the network activation time. Assuming a Markovian influence model, we prove that the ICOP is NP-hard, and then we present MIP formulations for three different types of coverage modes. A reformulation of the non-linear ‘big-M’ constraints, two types of valid cuts, and a fast heuristic based on the k-means algorithm are used as enhancements that facilitate solving the ICOP via an Iterative Decomposition Branch-and-Cut (IDBC) algorithm. In addition, we present an alternative discrete formulation of the ICOP using critical intersection points. Several experiments under various parameter configurations across instances with more than a hundred nodes and thousand arcs are conducted, showing the IDBC’s capability to provide optimal solutions within seconds or minutes for most instances. Moreover, the experiments reveal that the ICOP can significantly outperform a Geo-fence coverage model that does not consider network interactions to make location decisions.Keywords: Influence maximizationsocial networksmaximum coveragecritical intersection pointsbranch-and-cutDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgementsThis research is partially funded by the National Science Foundation (NSF) (Award ENG/CMMI # 2145553), by the Air Force Office of Scientific Research (AFORS) (Award # FA9550-22-1-0236), and the Office of Naval Research (ONR) (Award # N00014-19-1-2329).","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Influence Coverage Optimization Problem\",\"authors\":\"Majid Akhgar, Juan S. Borrero\",\"doi\":\"10.1080/24725854.2023.2261507\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"AbstractWe introduce the Influence Coverage Optimization Problem (ICOP), which is an influence maximization problem where the activation of nodes also depends on their location on the plane. Specifically, the ICOP assumes that there is a network where nodes become active (i.e., influenced) either by the influence they receive from interactions with active in-neighbors or by entering the coverage area of a physical ad or a Geo-fence. The objective is to locate a fixed number of ads or Geo-fences and modify the network influence rates to minimize the network activation time. Assuming a Markovian influence model, we prove that the ICOP is NP-hard, and then we present MIP formulations for three different types of coverage modes. A reformulation of the non-linear ‘big-M’ constraints, two types of valid cuts, and a fast heuristic based on the k-means algorithm are used as enhancements that facilitate solving the ICOP via an Iterative Decomposition Branch-and-Cut (IDBC) algorithm. In addition, we present an alternative discrete formulation of the ICOP using critical intersection points. Several experiments under various parameter configurations across instances with more than a hundred nodes and thousand arcs are conducted, showing the IDBC’s capability to provide optimal solutions within seconds or minutes for most instances. Moreover, the experiments reveal that the ICOP can significantly outperform a Geo-fence coverage model that does not consider network interactions to make location decisions.Keywords: Influence maximizationsocial networksmaximum coveragecritical intersection pointsbranch-and-cutDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgementsThis research is partially funded by the National Science Foundation (NSF) (Award ENG/CMMI # 2145553), by the Air Force Office of Scientific Research (AFORS) (Award # FA9550-22-1-0236), and the Office of Naval Research (ONR) (Award # N00014-19-1-2329).\",\"PeriodicalId\":56039,\"journal\":{\"name\":\"IISE Transactions\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IISE Transactions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/24725854.2023.2261507\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IISE Transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/24725854.2023.2261507","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
AbstractWe introduce the Influence Coverage Optimization Problem (ICOP), which is an influence maximization problem where the activation of nodes also depends on their location on the plane. Specifically, the ICOP assumes that there is a network where nodes become active (i.e., influenced) either by the influence they receive from interactions with active in-neighbors or by entering the coverage area of a physical ad or a Geo-fence. The objective is to locate a fixed number of ads or Geo-fences and modify the network influence rates to minimize the network activation time. Assuming a Markovian influence model, we prove that the ICOP is NP-hard, and then we present MIP formulations for three different types of coverage modes. A reformulation of the non-linear ‘big-M’ constraints, two types of valid cuts, and a fast heuristic based on the k-means algorithm are used as enhancements that facilitate solving the ICOP via an Iterative Decomposition Branch-and-Cut (IDBC) algorithm. In addition, we present an alternative discrete formulation of the ICOP using critical intersection points. Several experiments under various parameter configurations across instances with more than a hundred nodes and thousand arcs are conducted, showing the IDBC’s capability to provide optimal solutions within seconds or minutes for most instances. Moreover, the experiments reveal that the ICOP can significantly outperform a Geo-fence coverage model that does not consider network interactions to make location decisions.Keywords: Influence maximizationsocial networksmaximum coveragecritical intersection pointsbranch-and-cutDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgementsThis research is partially funded by the National Science Foundation (NSF) (Award ENG/CMMI # 2145553), by the Air Force Office of Scientific Research (AFORS) (Award # FA9550-22-1-0236), and the Office of Naval Research (ONR) (Award # N00014-19-1-2329).
IISE TransactionsEngineering-Industrial and Manufacturing Engineering
CiteScore
5.70
自引率
7.70%
发文量
93
期刊介绍:
IISE Transactions is currently abstracted/indexed in the following services: CSA/ASCE Civil Engineering Abstracts; CSA-Computer & Information Systems Abstracts; CSA-Corrosion Abstracts; CSA-Electronics & Communications Abstracts; CSA-Engineered Materials Abstracts; CSA-Materials Research Database with METADEX; CSA-Mechanical & Transportation Engineering Abstracts; CSA-Solid State & Superconductivity Abstracts; INSPEC Information Services and Science Citation Index.
Institute of Industrial and Systems Engineers and our publisher Taylor & Francis make every effort to ensure the accuracy of all the information (the "Content") contained in our publications. However, Institute of Industrial and Systems Engineers and our publisher Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Institute of Industrial and Systems Engineers and our publisher Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Institute of Industrial and Systems Engineers and our publisher Taylor & Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to, or arising out of the use of the Content. Terms & Conditions of access and use can be found at http://www.tandfonline.com/page/terms-and-conditions .