发布求助
文献互助 智能选刊 最新文献

Journal of Combinatorial Optimization最新文献

筛选
英文 中文
On greedy approximation algorithm for the minimum resolving dominating set problem 关于最小解析支配集问题的贪婪近似算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-28 DOI: 10.1007/s10878-024-01229-4
Hao Zhong
{"title":"On greedy approximation algorithm for the minimum resolving dominating set problem","authors":"Hao Zhong","doi":"10.1007/s10878-024-01229-4","DOIUrl":"https://doi.org/10.1007/s10878-024-01229-4","url":null,"abstract":"<p>In this paper, we investigate the minimum resolving dominating set problem which is a emerging combinatorial optimization problem in general graphs. We prove that the resolving dominating set problem is NP-hard and propose a greedy algorithm with an approximation ratio of (<span>(1 + 2ln n)</span>) by establishing a submodular potential function, where <i>n</i> is the node number of the input graph.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"131 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142536557","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
Fashion game on graphs with more than two actions 有两个以上动作的图形上的时尚游戏
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-28 DOI: 10.1007/s10878-024-01225-8
Qi Wang, Wensong Lin
{"title":"Fashion game on graphs with more than two actions","authors":"Qi Wang, Wensong Lin","doi":"10.1007/s10878-024-01225-8","DOIUrl":"https://doi.org/10.1007/s10878-024-01225-8","url":null,"abstract":"<p>We study the fashion game, a classical network coordination/anti-coordination game employed to model social dynamics in decision-making processes, especially in fashion choices. In this game, individuals, represented as vertices in a graph, make decisions based on their neighbors’ choices. Some individuals are positively influenced by their neighbors while others are negatively affected. Analyzing the game’s outcome aids in understanding fashion trends and flux within the population. In an instance of the fashion game, an action profile is formed when all individuals have made their choices. The utility of an individual under an action profile is defined according to the choices he and his neighbors made. A pure Nash equilibria is an action profile under which each individual has a nonnegative utility. To further study the existence of pure Nash equilibria, we investigate an associated optimization problem aimed at maximizing the minimal individual utility, referred to as the utility of a fashion game instance. The fashion game with two different but symmetric actions (choices) has been studied extensively in the literature. This paper seeks to extend the fashion game analysis to scenarios with more than two available actions, thereby enhancing comprehension of social dynamics in decision-making processes. We determine the utilities of all instances on paths, cycles and complete graphs. For instances where each individual likes to anti-coordinate, graph is planar and three actions are available, we illustrate the time complexity of determining the utility of such instances. Additionally, for instances containing both coordinating and anti-coordinating individuals, we extend the results on the time complexity of determining the utility of instances with two available actions to cases with more than two actions.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"3 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142536560","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
Algorithms for the bin packing problem with scenarios 带情景的垃圾箱打包问题算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-24 DOI: 10.1007/s10878-024-01221-y
Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, Rafael C. S. Schouery
{"title":"Algorithms for the bin packing problem with scenarios","authors":"Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, Rafael C. S. Schouery","doi":"10.1007/s10878-024-01221-y","DOIUrl":"https://doi.org/10.1007/s10878-024-01221-y","url":null,"abstract":"<p>This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence of uncertain scenarios, of which only one is realized. For this problem, we propose approximation algorithms whose ratios are bounded by the square root of the number of scenarios times the approximation ratio for an algorithm for the vector bin packing problem. We also show how an asymptotic polynomial-time approximation scheme is derived when the number of scenarios is constant, that is, not a part of the input. As a practical study of the problem, we present a branch-and-price algorithm to solve an exponential set-cover model and a variable neighborhood search heuristic. Experiments show the competence of the branch-and-price in obtaining optimal solutions for about 59% of the instances considered, while the combined heuristic and branch-and-price optimally solved 62% of the instances considered.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"13 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142489708","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
A MILP model for the connected multidimensional maximum bisection problem 连通多维最大分割问题的 MILP 模型
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-22 DOI: 10.1007/s10878-024-01220-z
Zoran Lj. Maksimović
{"title":"A MILP model for the connected multidimensional maximum bisection problem","authors":"Zoran Lj. Maksimović","doi":"10.1007/s10878-024-01220-z","DOIUrl":"https://doi.org/10.1007/s10878-024-01220-z","url":null,"abstract":"<p>The Maximum Bisection Problem (MBP) is a well-known combinatorial optimization problem that has been proven to be NP-hard. The maximum bisection of a graph is the partition of its set of vertices into two subsets with an equal number of vertices, where the weight of the edge cut is maximal. This work introduces a connected multidimensional generalization of the Maximum Bisection Problem. In this NP-hard problem, weights on edges are vectors of non-negative numbers, and subgraphs induced by partitions must be connected. A mixed integer linear programming (MILP) formulation is proposed with proof of its correctness. The MILP formulation of the problem has a polynomial number of variables and constraints</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"2 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142487584","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
Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement 优化医院床位分配，协调医疗效率和质量改进
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-21 DOI: 10.1007/s10878-024-01210-1
Haiyue Yu, Ting Shen, Liwei Zhong
{"title":"Optimizing hospital bed allocation for coordinated medical efficiency and quality improvement","authors":"Haiyue Yu, Ting Shen, Liwei Zhong","doi":"10.1007/s10878-024-01210-1","DOIUrl":"https://doi.org/10.1007/s10878-024-01210-1","url":null,"abstract":"<p>In this study, we aim to optimize hospital bed allocation to enhance medical service efficiency and quality. We developed an optimization model and algorithms considering cross-departmental bed-sharing costs, patient waiting costs, and the impact on medical quality when patients are assigned to non-primary departments. First, we propose an algorithm to calculate departmental similarity and quantify the effect on patients’ length of stay when admitted to non-primary departments. We then formulate a two-stage cost minimization problem: the first stage involves determining bed allocation for each department, and the second stage involves dynamic admission control decisions. For the second stage, we apply a dynamic programming method and approximate the model using deterministic linear programming to ensure practicality and computational efficiency. Numerical studies validate the effectiveness of our approach. Results show that our model and algorithms significantly improve bed resource utilization and medical service quality, supporting hospital management decisions.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"20 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142452390","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
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs 对于矩形网格图中简单的 s、t 路径，哈密顿路径图是连通的
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-19 DOI: 10.1007/s10878-024-01207-w
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
{"title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","authors":"Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides","doi":"10.1007/s10878-024-01207-w","DOIUrl":"https://doi.org/10.1007/s10878-024-01207-w","url":null,"abstract":"<p>An <i>s</i>, <i>t</i> Hamiltonian path <i>P</i> for an <span>(m times n)</span> rectangular grid graph <span>(mathbb {G})</span> is a Hamiltonian path from the top-left corner <i>s</i> to the bottom-right corner <i>t</i>. We define an operation “square-switch” on <i>s</i>, <i>t</i> Hamiltonian paths <i>P</i> affecting only those edges of <i>P</i> that lie in some small (2 units by 2 units) square subgrid of <span>(mathbb {G})</span>. We prove that when applied to suitable locations, the result of the square-switch is another <i>s</i>, <i>t</i> Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of <i>s</i>, <i>t</i> Hamiltonian paths we call <i>simple paths</i>, that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph <span>(mathcal {G})</span> whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path <i>P</i> to any given target simple path <span>(P')</span> in <span>(mathcal {O})</span>(<span>( |P |)</span>) time and <span>(mathcal {O})</span>(<span>( |P |)</span>) space using at most <span>({5} |P |/ {4})</span> square-switches, where <span>( |P |= m times n)</span> is the number of vertices in the grid graph <span>(mathbb {G})</span> and hence in any Hamiltonian path <i>P</i> for <span>(mathbb {G})</span>. Thus the diameter of the simple path graph <span>(mathcal {G})</span> is at most 5<i>mn</i>/ 4 for the square-switch operation, which we show is asymptotically tight for this operation.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"372 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142451395","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
Efficient heuristics to compute minimal and stable feedback arc sets 计算最小和稳定反馈弧集的高效启发式方法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-15 DOI: 10.1007/s10878-024-01209-8
Claudia Cavallaro, Vincenzo Cutello, Mario Pavone
{"title":"Efficient heuristics to compute minimal and stable feedback arc sets","authors":"Claudia Cavallaro, Vincenzo Cutello, Mario Pavone","doi":"10.1007/s10878-024-01209-8","DOIUrl":"https://doi.org/10.1007/s10878-024-01209-8","url":null,"abstract":"<p>Given a directed graph <span>(G=(V,A))</span>, we tackle the Minimum Feedback Arc Set (MFAS) Problem by designing an efficient algorithm to search for minimal and stable Feedback Arc Sets, i.e. such that none of the arcs can be reintroduced in the graph without disrupting acyclicity and such that for each vertex the number of eliminated outgoing (resp. incoming) arcs is not bigger than the number of remaining incoming (resp. outgoing) arcs. Our algorithm has a good polynomial upper bound and can therefore be applied even on large graphs. We also introduce an algorithm to generate strongly connected graphs with a known upper bound on their feedback arc set, and on such graphs we test our algorithm.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"40 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142440161","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
Explicit construction of mixed dominating sets in generalized Petersen graphs 广义彼得森图中混合支配集的显式构造
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-14 DOI: 10.1007/s10878-024-01222-x
Meysam Rajaati Bavil Olyaei, Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba
{"title":"Explicit construction of mixed dominating sets in generalized Petersen graphs","authors":"Meysam Rajaati Bavil Olyaei, Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba","doi":"10.1007/s10878-024-01222-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01222-x","url":null,"abstract":"<p>A mixed dominating set in a graph <span>(G=(V,E))</span> is a subset <i>D</i> of vertices and edges of <i>G</i> such that every vertex and edge in <span>((Vcup E)setminus D)</span> is a neighbor of some elements in <i>D</i>. The mixed domination number of <i>G</i>, denoted by <span>(gamma _{textrm{md}}(G))</span>, is the minimum size among all mixed dominating sets of <i>G</i>. For natural numbers <i>n</i> and <i>k</i>, where <span>(n &gt; 2k)</span>, a generalized Petersen graph <i>P</i>(<i>n</i>, <i>k</i>) is a graph with vertices <span>( {v_0, v_1, ldots , v_{n-1} }cup {u_0, u_1, ldots , u_{n-1}})</span> and edges <span>(cup _{0 le i le n-1} {v_{i} v_{i+1}, v_iu_i, u_iu_{i+k}})</span> where subscripts are modulo <i>n</i>. In this paper, we explicitly construct an optimal mixed dominating set for generalized Petersen graphs <i>P</i>(<i>n</i>, <i>k</i>) for <span>(k in {1, 2})</span>. Moreover, we establish some upper bound on mixed domination number for other generalized Petersen graphs.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"229 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142431657","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 approximations for monotone submodular maximization with knapsack constraint 带 Knapsack 约束的单调亚模块最大化的新近似值
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-13 DOI: 10.1007/s10878-024-01214-x
Hongmin W. Du, Xiang Li, Guanghua Wang
{"title":"New approximations for monotone submodular maximization with knapsack constraint","authors":"Hongmin W. Du, Xiang Li, Guanghua Wang","doi":"10.1007/s10878-024-01214-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01214-x","url":null,"abstract":"<p>Given a monotone submodular set function with a knapsack constraint, its maximization problem has two types of approximation algorithms with running time <span>(O(n^2))</span> and <span>(O(n^5))</span>, respectively. With running time <span>(O(n^5))</span>, the best performance ratio is <span>(1-1/e)</span>. With running time <span>(O(n^2))</span>, the well-known performance ratio is <span>((1-1/e)/2)</span> and an improved one is claimed to be <span>((1-1/e^2)/2)</span> recently. In this paper, we design an algorithm with running <span>(O(n^2))</span> and performance ratio <span>(1-1/e^{2/3})</span>, and an algorithm with running time <span>(O(n^3))</span> and performance ratio 1/2.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"17 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142431653","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
Approximate weak efficiency of the set-valued optimization problem with variable ordering structures 具有可变排序结构的集值优化问题的近似弱效率
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2024-10-12 DOI: 10.1007/s10878-024-01211-0
Zhiang Zhou, Wenbin Wei, Fei Huang, Kequan Zhao
{"title":"Approximate weak efficiency of the set-valued optimization problem with variable ordering structures","authors":"Zhiang Zhou, Wenbin Wei, Fei Huang, Kequan Zhao","doi":"10.1007/s10878-024-01211-0","DOIUrl":"https://doi.org/10.1007/s10878-024-01211-0","url":null,"abstract":"<p>In locally convex spaces, we introduce the new notion of approximate weakly efficient solution of the set-valued optimization problem with variable ordering structures (in short, SVOPVOS) and compare it with other kinds of solutions. Under the assumption of near <span>(mathcal {D}(cdot ))</span>-subconvexlikeness, we establish linear scalarization theorems of (SVOPVOS) in the sense of approximate weak efficiency. Finally, without any convexity, we obtain a nonlinear scalarization theorem of (SVOPVOS). We also present some examples to illustrate our results.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"42 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2024-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142415785","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信