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

Journal of Combinatorial Optimization最新文献

筛选
英文 中文
A note between transitive $$C_4$$-factor and oriented Ramsey number 传递$$C_4$$因子与有向拉姆齐数的关系
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-02 DOI: 10.1007/s10878-026-01393-9
Ming Chen, Zhengke Miao, Shan Zhou
{"title":"A note between transitive $$C_4$$-factor and oriented Ramsey number","authors":"Ming Chen, Zhengke Miao, Shan Zhou","doi":"10.1007/s10878-026-01393-9","DOIUrl":"https://doi.org/10.1007/s10878-026-01393-9","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"61 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146101773","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
Output-sensitive complexity of multi-objective integer network flow problems 多目标整数网络流问题的输出敏感复杂度
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-23 DOI: 10.1007/s10878-025-01376-2
David Könen, Michael Stiglmayr
{"title":"Output-sensitive complexity of multi-objective integer network flow problems","authors":"David Könen, Michael Stiglmayr","doi":"10.1007/s10878-025-01376-2","DOIUrl":"https://doi.org/10.1007/s10878-025-01376-2","url":null,"abstract":"This paper addresses the <jats:italic>output-sensitive</jats:italic> complexity for linear multi-objective minimum cost integer flow problem, providing insights into the time complexity for enumerating all supported nondominated vectors. The paper shows that there cannot exist an output-polynomial time algorithm for the enumeration of all supported nondominated vectors that determine the vectors in an lexicographically ordered way in the outcome space unless <jats:inline-formula> <jats:tex-math>$$textbf{P}=textbf{N P}$$</jats:tex-math> </jats:inline-formula> . Moreover, novel methods for identifying supported nondominated vectors in bi-objective minimum cost integer flow problems are proposed, accompanied by a numerical comparison between decision- and objective-space methods. A novel, equivalent, and more compact formulation of the minimum cost flow ILP formulation used in the <jats:inline-formula> <jats:tex-math>$$varepsilon $$</jats:tex-math> </jats:inline-formula> -constraint scalarization approach is introduced, demonstrating enhanced efficiency in the numerical tests.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"60 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146048527","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
PTAS for Euclidean travelling salesman problem with soft time windows 带软时间窗的欧几里得旅行商问题的PTAS
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-19 DOI: 10.1007/s10878-025-01387-z
Liang Song, Songsong Wu, Yongxuan Lai, Chunyan Liu, Hejiao Huang, Hongwei Du
{"title":"PTAS for Euclidean travelling salesman problem with soft time windows","authors":"Liang Song, Songsong Wu, Yongxuan Lai, Chunyan Liu, Hejiao Huang, Hongwei Du","doi":"10.1007/s10878-025-01387-z","DOIUrl":"https://doi.org/10.1007/s10878-025-01387-z","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"48 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146005592","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
Adaptive latent space dip clustering and few-shot wavelet learning for android malware detection 基于自适应潜空间倾角聚类和小波学习的android恶意软件检测
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-11 DOI: 10.1007/s10878-025-01384-2
K. Selvi, P. Vijayalakshmi, B. Selvalakshmi, G. Manikandan
{"title":"Adaptive latent space dip clustering and few-shot wavelet learning for android malware detection","authors":"K. Selvi, P. Vijayalakshmi, B. Selvalakshmi, G. Manikandan","doi":"10.1007/s10878-025-01384-2","DOIUrl":"https://doi.org/10.1007/s10878-025-01384-2","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"253 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947439","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
Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions 具有机器依赖凸资源消耗函数的双准则置换流水车间调度问题
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-11 DOI: 10.1007/s10878-025-01385-1
Byung-Cheon Choi, Myoung-Ju Park
{"title":"Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions","authors":"Byung-Cheon Choi, Myoung-Ju Park","doi":"10.1007/s10878-025-01385-1","DOIUrl":"https://doi.org/10.1007/s10878-025-01385-1","url":null,"abstract":"We consider a bicriteria permutation flow shop scheduling problem, where each operation’s processing time varies inversely with the power of the resource allocation assigned to the machine. The two criteria are the makespan and the total resource consumption cost, resulting in the formulation of four distinct models. The first model focuses on minimizing the sum of both criteria. In the second and third models, one criterion is minimized under a constraint imposed on the other. The fourth model aims to identify Pareto front. We show that these four models can be solved in polynomial time for the two-machine case; however, they become strongly NP-hard when extended to the three-machine case.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"82 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947440","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
Structured query language injection attack detection via giant magnificent frigatebird optimization and federated learning 结构化查询语言注入攻击检测，基于巨型军舰鸟优化和联邦学习
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-11 DOI: 10.1007/s10878-025-01379-z
Madhavi Perla, Valli Kumari Vatsavayi
{"title":"Structured query language injection attack detection via giant magnificent frigatebird optimization and federated learning","authors":"Madhavi Perla, Valli Kumari Vatsavayi","doi":"10.1007/s10878-025-01379-z","DOIUrl":"https://doi.org/10.1007/s10878-025-01379-z","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"9 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947437","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
Hytranet: a deep learning model for traffic congestion prediction in road networks Hytranet：用于道路网络交通拥堵预测的深度学习模型
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-11 DOI: 10.1007/s10878-025-01382-4
Manoj Kumar, Kranti Kumar
{"title":"Hytranet: a deep learning model for traffic congestion prediction in road networks","authors":"Manoj Kumar, Kranti Kumar","doi":"10.1007/s10878-025-01382-4","DOIUrl":"https://doi.org/10.1007/s10878-025-01382-4","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"3 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947380","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
On the transmission irregular trees with the maximum Wiener index 关于具有最大Wiener指数的传输不规则树
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-11 DOI: 10.1007/s10878-025-01383-3
Ivan Damnjanović, Anran Xu, Kexiang Xu
{"title":"On the transmission irregular trees with the maximum Wiener index","authors":"Ivan Damnjanović, Anran Xu, Kexiang Xu","doi":"10.1007/s10878-025-01383-3","DOIUrl":"https://doi.org/10.1007/s10878-025-01383-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"46 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947438","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
Cover-free families on hypergraphs and combinatorial group testing. 超图上的无盖族与组合群检验。
IF 0.8 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-01 Epub Date: 2026-06-14 DOI: 10.1007/s10878-026-01429-0
Thaís Bardini Idalino, Lucia Moura
{"title":"Cover-free families on hypergraphs and combinatorial group testing.","authors":"Thaís Bardini Idalino, Lucia Moura","doi":"10.1007/s10878-026-01429-0","DOIUrl":"10.1007/s10878-026-01429-0","url":null,"abstract":"<p><p>Combinatorial group testing (CGT) is used to identify a subset of defective items from a set of items by grouping them together and performing a small number of tests on the groups. Cover-free families (CFFs), also called superimposed codes, are well-studied combinatorial structures used to design the groups in such a way that identifying the defective items from test results (decoding) can be done efficiently. This paper focuses on generalizations of CFFs that take into account a known structure among items to be tested. This structure is modeled by a hypergraph, where vertices are items to be tested and edges represent a predictable relationship among items. A typical application is testing for an infectious disease in a population where there are clusters of individuals with high contact rates, such as households within a neighbourhood or students taking courses within a school. As we aim at minimizing the number of tests, CFFs on hypergraphs yield an interesting combinatorial optimization problem and, like CFFs, have connections to coding theory, design theory and extremal set theory. In this paper, we discuss various types of CFFs on hypergraphs, decoding algorithms, bounds and constructions. In particular, we give several constructions that use the structure and properties of the underlying hypergraph.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"51 5","pages":"55"},"PeriodicalIF":0.8,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13265591/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148267005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. 梳凸和毛虫凸二部图的表3着色。
IF 1.1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-01-01 Epub Date: 2026-05-16 DOI: 10.1007/s10878-026-01424-5
Banu Baklan Şen, Thomas Erlebach, Öznur Yaşar
{"title":"List 3-coloring on comb-convex and caterpillar-convex bipartite graphs.","authors":"Banu Baklan Şen, Thomas Erlebach, Öznur Yaşar","doi":"10.1007/s10878-026-01424-5","DOIUrl":"https://doi.org/10.1007/s10878-026-01424-5","url":null,"abstract":"<p><p>Given a graph <math><mrow><mi>G</mi> <mo>=</mo> <mo>(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo>)</mo></mrow> </math> and a list of available colors <i>L</i>(<i>v</i>) for each vertex <math><mrow><mi>v</mi> <mo>∈</mo> <mi>V</mi></mrow> </math> , where <math><mrow><mi>L</mi> <mo>(</mo> <mi>v</mi> <mo>)</mo> <mo>⊆</mo> <mo>{</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>k</mi> <mo>}</mo></mrow> </math> , List <i>k</i>-Coloring refers to the problem of assigning colors to the vertices of <i>G</i> such that each vertex receives a color from its own list and no two neighboring vertices receive the same color. The decision version of the problem List 3-Coloring is NP-complete even for bipartite graphs, and its complexity on comb-convex bipartite graphs has been an open problem. We give a polynomial-time algorithm to solve List 3-Coloring for caterpillar-convex bipartite graphs, a superclass of comb-convex bipartite graphs. We also give a polynomial-time recognition algorithm for the class of caterpillar-convex bipartite graphs.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"51 5","pages":"47"},"PeriodicalIF":1.1,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13179909/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147976776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术文献互助群
群 号：604180095
Book学术官方微信
小红书