Journal of Combinatorial Optimization最新文献_第2页

Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents 有两个竞争代理的双机无等待流动车间调度问题的算法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-30 DOI: 10.1007/s10878-024-01198-8

Qi-Xia Yang, Long-Cheng Liu, Min Huang, Tian-Run Wang

{"title":"Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents","authors":"Qi-Xia Yang, Long-Cheng Liu, Min Huang, Tian-Run Wang","doi":"10.1007/s10878-024-01198-8","DOIUrl":"https://doi.org/10.1007/s10878-024-01198-8","url":null,"abstract":"In this paper, we consider the following two-machine no-wait flow shop scheduling problem with two competing agents (F2~|~M_1rightarrow M_2,~ M_2,~ p_{ij}^{A} = p,~ notext{- }wait~|~C_{max }^A:~ C_{max }^B~le Q ): Given a set of n jobs (mathcal {J} = { J_1, J_2, ldots , J_n}) and two competing agents A and B. Agent A is associated with a set of (n_A) jobs (mathcal {J}^A = {J_1^A, J_2^A, ldots , J_{n_A}^A}) to be processed on the machine (M_1) first and then on the machine (M_2) with no-wait constraint, and agent B is associated with a set of (n_B) jobs (mathcal {J}^B = {J_1^B, J_2^B, ldots , J_{n_B}^B}) to be processed on the machine (M_2) only, where the processing times for the jobs of agent A are all the same (i.e., (p_{ij}^A = p)), (mathcal {J} = mathcal {J}^A cup mathcal {J}^B) and (n = n_A + n_B). The objective is to build a schedule (pi ) of the n jobs that minimizing the makespan of agent A while maintaining the makespan of agent B not greater than a given value Q. We first show that the problem is polynomial time solvable in some special cases. For the non-solvable case, we present an (O(n log n))-time ((1 + frac{1}{n_A +1}))-approximation algorithm and show that this ratio of ((1 + frac{1}{n_A +1})) is asymptotically tight. Finally, ((1+epsilon ))-approximation algorithms are provided.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141857939","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

First zagreb spectral radius of unicyclic graphs and trees 单环图和树的第一个萨格勒布谱半径

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-30 DOI: 10.1007/s10878-024-01195-x

Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal

引用次数: 0

An improved upper bound for the online graph exploration problem on unicyclic graphs 单环图上在线图探索问题的改进上界

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-29 DOI: 10.1007/s10878-024-01192-0

Koji M. Kobayashi, Ying Li

引用次数: 0

Risk-adjusted exponential gradient strategies for online portfolio selection 在线投资组合选择的风险调整指数梯度策略

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-28 DOI: 10.1007/s10878-024-01187-x

Jin’an He, Fangping Peng, Xiuying Xie

{"title":"Risk-adjusted exponential gradient strategies for online portfolio selection","authors":"Jin’an He, Fangping Peng, Xiuying Xie","doi":"10.1007/s10878-024-01187-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01187-x","url":null,"abstract":"This paper concerns online portfolio selection problem whose main feature is with no any statistical assumption on future asset prices. Since online portfolio selection aims to maximize the cumulative wealth, most existing online portfolio strategies do not consider risk factors into the model. To enrich the research on online portfolio selection, we introduce the risk factors into the model and propose two novel risk-adjusted online portfolio strategies. More specifically, we first choose several exponential gradient ((text {EG}(eta ))) with different values of parameter (eta ) to build an expert pool. Later, we construct two risk methods to measure performance of each expert. Finally, we calculate the portfolio by the weighted average over all expert advice. We present theoretical and experimental results respectively to analyze the performance of the proposed strategies. Theoretical results show that the proposed strategies not only track the expert with the lowest risk, but also are universal, i.e., they exhibit the same asymptotic average logarithmic growth rate as best constant rebalanced portfolio (BCRP) determined in hindsight. We conduct extensive experiments by using daily stock data collected from the American and Chinese stock markets. Experimental results show the proposed strategies outperform existing online portfolio in terms of the return and risk metrics in most cases.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141769094","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

Maximizing stochastic set function under a matroid constraint from decomposition 在来自分解的矩阵约束条件下最大化随机集合函数

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-28 DOI: 10.1007/s10878-024-01193-z

Shengminjie Chen, Donglei Du, Wenguo Yang, Suixiang Gao

{"title":"Maximizing stochastic set function under a matroid constraint from decomposition","authors":"Shengminjie Chen, Donglei Du, Wenguo Yang, Suixiang Gao","doi":"10.1007/s10878-024-01193-z","DOIUrl":"https://doi.org/10.1007/s10878-024-01193-z","url":null,"abstract":"In this work, we focus on maximizing the stochastic DS decomposition problem. If the constraint is a uniform matroid, we design an adaptive policy, namely Myopic Parameter Conditioned Greedy, and prove its theoretical guarantee (f(varTheta (pi _k))-(1-c_G)g(varTheta (pi _k))ge (1-e^{-1})F(pi ^*_A, varTheta (pi _k)) - G(pi ^*_A,varTheta (pi _k))), where (F(pi ^*_A, varTheta (pi _k)) = mathbb {E}_{varTheta }[f(varTheta (pi ^*_A)) vert varTheta (pi _k)]). When the constraint is a general matroid constraint, we design the Parameter Measured Continuous Conditioned Greedy to return a fractional solution. To round an integer solution from the fractional solution, we adopt the lattice contention resolution and prove that there is a ((b, frac{1-e^{-b}}{b})) lattice CR scheme under a matroid constraint. Additionally, we adopt the pipage rounding to obtain a non-adaptive policy with the theoretical guarantee (F(pi )-(1-c_G)G(pi ) ge (1-e^{-1}) F(pi ^*_A) - G(pi ^*_A) - O(epsilon )) and utlize the ((1,1-e^{-1}))-lattice contention resolution scheme (tau ) to obtain an adaptive solution (mathbb {E}_{tau sim varLambda } [f(tau (varTheta (pi )))- (1-c_G) g(tau (varTheta (pi )))] ge (1-e^{-1})^2F(pi ^*_A,varTheta (pi )) - (1-e^{-1}) G(pi ^*_A,varTheta (pi )) -O(epsilon )). Since any set function can be expressed as the DS decomposition, our framework provides a method for solving the maximization problem of set functions defined on a random variable set.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141769096","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

Embedding and the first Laplace eigenvalue of a finite graph 有限图的嵌入和第一个拉普拉斯特征值

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-16 DOI: 10.1007/s10878-024-01191-1

Takumi Gomyou, Toshimasa Kobayashi, Takefumi Kondo, Shin Nayatani

引用次数: 0

A hybrid grey wolf optimizer for engineering design problems 工程设计问题的混合灰狼优化器

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-03 DOI: 10.1007/s10878-024-01189-9

Shuilin Chen, Jianguo Zheng

{"title":"A hybrid grey wolf optimizer for engineering design problems","authors":"Shuilin Chen, Jianguo Zheng","doi":"10.1007/s10878-024-01189-9","DOIUrl":"https://doi.org/10.1007/s10878-024-01189-9","url":null,"abstract":"Grey wolf optimizer (GWO) is one of the most popular metaheuristics, and it has been presented as highly competitive with other comparison methods. However, the basic GWO needs some improvement, such as premature convergence and imbalance between exploitation and exploration. To address these weaknesses, this paper develops a hybrid grey wolf optimizer (HGWO), which combines the Halton sequence, dimension learning-based, crisscross strategy, and Cauchy mutation strategy. Firstly, the Halton sequence is used to enlarge the search scope and improve the diversity of the solutions. Then, the dimension learning-based is used for position update to balance exploitation and exploration. Furthermore, the crisscross strategy is introduced to enhance convergence precision. Finally, the Cauchy mutation strategy is adapted to avoid falling into the local optimum. The effectiveness of HGWO is demonstrated by comparing it with advanced algorithms on the 15 benchmark functions in different dimensions. The results illustrate that HGWO outperforms other advanced algorithms. Moreover, HGWO is used to solve eight real-world engineering problems, and the results demonstrate that HGWO is superior to different advanced algorithms.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521471","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

Injective edge-coloring of claw-free subcubic graphs 无爪次立方图的注入边着色

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-03 DOI: 10.1007/s10878-024-01188-w

Qing Cui, Zhenmeng Han

{"title":"Injective edge-coloring of claw-free subcubic graphs","authors":"Qing Cui, Zhenmeng Han","doi":"10.1007/s10878-024-01188-w","DOIUrl":"https://doi.org/10.1007/s10878-024-01188-w","url":null,"abstract":"An injective edge-coloring of a graph G is an edge-coloring of G such that any two edges that are at distance 2 or in a common triangle receive distinct colors. The injective chromatic index of G is the minimum number of colors needed to guarantee that G admits an injective edge-coloring. Ferdjallah, Kerdjoudj and Raspaud showed that the injective chromatic index of every subcubic graph is at most 8, and conjectured that 8 can be improved to 6. Kostochka, Raspaud and Xu further proved that every subcubic graph has the injective chromatic index at most 7, and every subcubic planar graph has the injective chromatic index at most 6. In this paper, we consider the injective edge-coloring of claw-free subcubic graphs. We show that every connected claw-free subcubic graph, apart from two exceptions, has the injective chromatic index at most 5. We also consider the list version of injective edge-coloring and prove that the list injective chromatic index of every claw-free subcubic graph is at most 6. Both results are sharp and strengthen a recent result of Yang and Wu which asserts that every claw-free subcubic graph has the injective chromatic index at most 6.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521498","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

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming 通过整数线性规划寻找 4 规则多图的第二哈密顿分解

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-03 DOI: 10.1007/s10878-024-01184-0

Andrei V. Nikolaev, Egor V. Klimov

引用次数: 0

Approximation algorithms for two clustered arc routing problems 两种聚弧路由问题的逼近算法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-03 DOI: 10.1007/s10878-024-01190-2

Xiaoguang Bao, Xinhao Ni

{"title":"Approximation algorithms for two clustered arc routing problems","authors":"Xiaoguang Bao, Xinhao Ni","doi":"10.1007/s10878-024-01190-2","DOIUrl":"https://doi.org/10.1007/s10878-024-01190-2","url":null,"abstract":"Given a strongly connected mixed graph (G=(V,E,A)), where V represents the vertex set, E is the undirected edge set, and A is the directed arc set, (R subseteq E) is a subset of required edges and is divided into p clusters (R_1,R_2,dots ,R_p), and A is a set of required arcs and is partitioned into q clusters (A_1,A_2,ldots ,A_q). Each edge in E and each arc in A are associated with a nonnegative weight and the weight function satisfies the triangle inequality. In this paper we consider two clustered arc routing problems. The first is the Clustered Rural Postman Problem, in which A is empty and the objective is to find a minimum-weight closed walk such that all the edges in R are serviced and the edges in (R_i) ((1le i le p)) are serviced consecutively. The other is the Clustered Stacker Crane Problem, in which R is empty and the goal is to find a minimum-weight closed walk that traverses all the arcs in A and services the arcs in (A_j) ((1le j le q)) consecutively. For both problems, we propose constant-factor approximation algorithms with ratios 13/6 and 19/6, respectively.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141521758","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