Journal of Combinatorial Optimization最新文献

The undirected optical indices of trees 树木的非定向光学指数

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01255-2

Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong

引用次数: 0

Agent-constrained truthful facility location games 代理受限的真实设施位置博弈

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-025-01258-7

Argyrios Deligkas, Mohammad Lotfi, Alexandros A. Voudouris

引用次数: 0

$$(K_{1}vee {P_{t})}$$ -saturated graphs with minimum number of edges $$(K_{1}vee {P_{t})}$$ -具有最小边数的饱和图

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01256-1

Jinze Hu, Shengjin Ji, Qing Cui

引用次数: 0

Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model 广告满足分类规划：多项逻辑模型下的联合广告与分类优化

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01257-0

Chenhao Wang, Yao Wang, Shaojie Tang

{"title":"Advertising meets assortment planning: joint advertising and assortment optimization under multinomial logit model","authors":"Chenhao Wang, Yao Wang, Shaojie Tang","doi":"10.1007/s10878-024-01257-0","DOIUrl":"https://doi.org/10.1007/s10878-024-01257-0","url":null,"abstract":"Despite the assortment optimization problem has been widely studied in the past decades, the interplay between advertising and its implications for this issue remains under-explored. This study seeks to bridge this research gap by tackling the combined challenge of advertising and assortment optimization. We assume that advertising can increase the awareness of specific products, and the magnitude of this effect is jointly depends on the product-specific effectiveness of advertising and the allocated advertising budget. For this joint problem, our objective is to maximize the expected revenue by finding the optimal advertising strategy and the displayed assortment. In this work, we analyze the structure of this problem and propose efficient approaches to solve it across different scenarios. In the unconstrained setting, we demonstrate that the optimal assortment includes products whose revenue exceeds a certain threshold. When there is a cardinality constraint for the assortment, we consider a relaxed problem and propose an efficient method to identify a near-optimal solution. We also examine the joint assortment, pricing, and advertising problem in both unconstrained and cardinality-constrained settings, incorporating the fairness constraint for the advertising strategy and extending our findings to account for consumer sequential decision-making patterns. Through a series of numerical tests, we confirm the validity of our methods and demonstrate that they outperform existing heuristic approaches.\u0000","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"32 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An improved PTAS for covering targets with mobile sensors 一种用于移动传感器覆盖目标的改进PTAS

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01253-4

Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo, Jittat Fakcharoenphol

引用次数: 0

Recognizing integrality of weighted rectangles partitions 加权矩形分区的完整性识别

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01252-5

Paul Deuker, Ulf Friedrich

引用次数: 0

Degree and betweenness-based label propagation for community detection 基于度和间性标签传播的社群检测

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01254-3

Qiufen Ni, Jun Wang, Zhongzheng Tang

{"title":"Degree and betweenness-based label propagation for community detection","authors":"Qiufen Ni, Jun Wang, Zhongzheng Tang","doi":"10.1007/s10878-024-01254-3","DOIUrl":"https://doi.org/10.1007/s10878-024-01254-3","url":null,"abstract":"Community detection, as a crucial network analysis technique, holds significant application value in uncovering the underlying organizational structure in complex networks. In this paper, we propose a degree and betweenness-based label propagation method for community detection (DBLPA). First, we calculate the importance of each node by combining node degree and betweenness centrality. A node i is considered as a core node in the network if its importance is maximal among its neighbor nodes. Next, layer-by-layer label propagation starts from core nodes. The first layer of nodes for label propagation consists of the first-order neighbors of all core nodes. In the first layer of label propagation, the labels of core nodes are first propagated to the non-common neighbor nodes between core nodes, and then to the common neighbor nodes between core nodes. At the same time, the flag parameter is set to record the changing times of a node’s label, which is helpful to calibrate the node’s labels during the label propagation. It effectively improves the misclassification in the process of label propagation. We test the DBLPA on four real network datasets and nine synthetic network datasets, and the experimental results show that the DBLPA can effectively improve the accuracy of community detection.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"9 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142990937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Social media actors: perception and optimization of influence across different types 社交媒体参与者：感知和优化不同类型的影响力

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2025-01-20 DOI: 10.1007/s10878-024-01238-3

Alexander A. Kharlamov, Aleksey N. Raskhodchikov, Maria Pilgun

引用次数: 0

Optimal dispatching of electric vehicles based on optimized deep learning in IoT 基于物联网优化深度学习的电动汽车优化调度

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-12-26 DOI: 10.1007/s10878-024-01251-6

V. Agalya, M. Muthuvinayagam, R. Gandhi

{"title":"Optimal dispatching of electric vehicles based on optimized deep learning in IoT","authors":"V. Agalya, M. Muthuvinayagam, R. Gandhi","doi":"10.1007/s10878-024-01251-6","DOIUrl":"https://doi.org/10.1007/s10878-024-01251-6","url":null,"abstract":"Recent years have witnessed a growing trend in the utilization of Electric Vehicles (EVs), however with the increased usage of EVs, appropriate strategies for supporting the charging demands has not garnered much attention. The absence of adaptable plans in charging may result in minimized participation; further, the charging demands have to be addressed with utmost care for ensuring reliability and efficiency of the grid. In this paper, an efficient EV charging technique based on blockchain based user transaction and smart contract is devised. Here, charge scheduling is performed by acquiring the information the charging demand of the EV over Internet of things. In case the EV does not have sufficient power to reach the target, nearest Charging Station (CS) with the minimal electricity price is identified. The CS is selected considering various factors, such average waiting time, distance, power, traffic, and so on. Here, power prediction is performed using the Deep Maxout Network (DMN), whose weights are adapted based on the devised Exponentially Snake Optimization (ESO) algorithm. Furthermore, the efficacy of the devised ESO-DMN is examined considering metrics, like average waiting time, distance, and number of EVs charged and power and is found to have attained values of 1.937 s, 13.952 km, 55 and 2.876 J.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"15 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142888180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lollipop and cubic weight functions for graph pebbling 图卵石的棒棒糖和立方权函数

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-12-25 DOI: 10.1007/s10878-024-01248-1

Marshall Yang, Carl Yerger, Runtian Zhou

引用次数: 0