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

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":"19 1","pages":""},"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":"35 1","pages":""},"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":"62 1","pages":""},"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":"19 1","pages":""},"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

Improved kernelization and fixed-parameter algorithms for bicluster editing 用于双簇编辑的改进型核化和固定参数算法

IF 1 4区数学

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

Manuel Lafond

引用次数: 0

On ABC spectral radius of uniform hypergraphs 论均匀超图的 ABC 谱半径

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-28 DOI: 10.1007/s10878-024-01182-2

Hongying Lin, Bo Zhou

引用次数: 0

A neural network accelerated optimization method for FPGA 用于 FPGA 的神经网络加速优化方法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-25 DOI: 10.1007/s10878-024-01117-x

Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie

{"title":"A neural network accelerated optimization method for FPGA","authors":"Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie","doi":"10.1007/s10878-024-01117-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01117-x","url":null,"abstract":"A neural network accelerated optimization method for FPGA hardware platform is proposed. The method realizes the optimized deployment of neural network algorithms for FPGA hardware platforms from three aspects: computational speed, flexible transplantation, and development methods. Replacing multiplication based on Mitchell algorithm not only breaks through the speed bottleneck of neural network hardware acceleration caused by long multiplication period, but also makes the parallel acceleration of neural network algorithm get rid of the dependence on the number of hardware multipliers in FPGA, which can give full play to the advantages of FPGA parallel acceleration and maximize the computing speed. Based on the configurable strategy of neural network parameters, the number of network layers and nodes within layers can be adjusted according to different logical resource of FPGA, improving the flexibility of neural network transplantation. The adoption of HLS development method overcomes the shortcomings of RTL method in designing complex neural network algorithms, such as high difficulty in development and long development cycle. Using the Cyclone V SE 5CSEBA6U23I7 FPGA as the target device, a parameter configurable BP neural network was designed based on the proposed method. The usage of logical resources such as ALUT, Flip-Flop, RAM, and DSP were 39.6%, 40%, 56.9%, and 18.3% of the pre-optimized ones, respectively. The feasibility of the proposed method was verified using MNIST digital recognition and facial recognition as application scenarios. Compare to pre-optimization, the test time of MNIST number recognition is reduced to 67.58%, and the success rate was lost 0.195%. The test time for facial recognition applications was reduced to 69.571%, and the success rate of combining LDA algorithm was lost within 4%.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"28 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141448358","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

New efficient algorithms for the two-machine no-wait chain-reentrant shop problem 双机无等待链式逆向商店问题的新型高效算法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-16 DOI: 10.1007/s10878-024-01180-4

Nazim Sami, Karim Amrouche, Mourad Boudhar

引用次数: 0