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

Journal of Combinatorial Optimization最新文献

筛选
英文 中文
Improved approximation algorithm for min-max correlation clustering problem with penalties 带惩罚的最小-最大相关聚类问题的改进逼近算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-10-17 DOI: 10.1007/s10878-026-01496-3
Yuebo Huang,Sai Ji,Xiaoyun Tian,Kun Zhou
{"title":"Improved approximation algorithm for min-max correlation clustering problem with penalties","authors":"Yuebo Huang,Sai Ji,Xiaoyun Tian,Kun Zhou","doi":"10.1007/s10878-026-01496-3","DOIUrl":"https://doi.org/10.1007/s10878-026-01496-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"78 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149208868","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
Minimum Randić index of molecular trees with a perfect matching 具有完美匹配的分子树的最小randiovic指数
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-10-16 DOI: 10.1007/s10878-026-01478-5
Jianwei Du,Xiaoling Sun
{"title":"Minimum Randić index of molecular trees with a perfect matching","authors":"Jianwei Du,Xiaoling Sun","doi":"10.1007/s10878-026-01478-5","DOIUrl":"https://doi.org/10.1007/s10878-026-01478-5","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"32 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149208870","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
Computation and analysis of the face index for benzenoid planar octahedron networks 苯类平面八面体网络面指数的计算与分析
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-10-16 DOI: 10.1007/s10878-026-01483-8
Jai Parkash,Vijay Kumar Bhat
{"title":"Computation and analysis of the face index for benzenoid planar octahedron networks","authors":"Jai Parkash,Vijay Kumar Bhat","doi":"10.1007/s10878-026-01483-8","DOIUrl":"https://doi.org/10.1007/s10878-026-01483-8","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"51 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149208869","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 new form of Gallai theorem on regular hypergraphs 正则超图上Gallai定理的一个新形式
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-10-15 DOI: 10.1007/s10878-026-01486-5
Zhongzheng Tang,Haoyang Zou,Zhuo Diao
{"title":"A new form of Gallai theorem on regular hypergraphs","authors":"Zhongzheng Tang,Haoyang Zou,Zhuo Diao","doi":"10.1007/s10878-026-01486-5","DOIUrl":"https://doi.org/10.1007/s10878-026-01486-5","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"26 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149208871","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
Approximation algorithm for parallel-batch scheduling with resource matching and rejection 具有资源匹配和拒绝的并行批调度近似算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-10-01 DOI: 10.1007/s10878-026-01467-8
Wenhua Li,Liang Zhang,Ran Lin,Shisheng Li
{"title":"Approximation algorithm for parallel-batch scheduling with resource matching and rejection","authors":"Wenhua Li,Liang Zhang,Ran Lin,Shisheng Li","doi":"10.1007/s10878-026-01467-8","DOIUrl":"https://doi.org/10.1007/s10878-026-01467-8","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"18 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149089980","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
Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem 求解约束强斯坦纳连通性增强问题的近似算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-09-27 DOI: 10.1007/s10878-026-01468-7
Junran Lichen,Shuwen Ge,Runtao Xie,Ping Yang
{"title":"Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem","authors":"Junran Lichen,Shuwen Ge,Runtao Xie,Ping Yang","doi":"10.1007/s10878-026-01468-7","DOIUrl":"https://doi.org/10.1007/s10878-026-01468-7","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"107 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149049434","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
Navigating uncertainties in medical logistics: the power of big data and information transparency 医疗物流中的不确定性：大数据和信息透明的力量
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-09-26 DOI: 10.1007/s10878-026-01449-w
Mingchuan You,Zhiyong Zhang,Yongqiang Shi
{"title":"Navigating uncertainties in medical logistics: the power of big data and information transparency","authors":"Mingchuan You,Zhiyong Zhang,Yongqiang Shi","doi":"10.1007/s10878-026-01449-w","DOIUrl":"https://doi.org/10.1007/s10878-026-01449-w","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"7 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149049435","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
Minimum power partial cover meets fairness: improved approximation guarantees 最小功率部分覆盖满足公平性：改进的近似保证
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-09-26 DOI: 10.1007/s10878-026-01477-6
Chensheng Ma,Mingchao Zhou,Qingye Shou,Zhao Zhang
{"title":"Minimum power partial cover meets fairness: improved approximation guarantees","authors":"Chensheng Ma,Mingchao Zhou,Qingye Shou,Zhao Zhang","doi":"10.1007/s10878-026-01477-6","DOIUrl":"https://doi.org/10.1007/s10878-026-01477-6","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"15 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149049438","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
Compact SAT encoding for power peak minimization in assembly line balancing 用于装配线平衡中功率峰值最小化的紧凑SAT编码
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-09-26 DOI: 10.1007/s10878-026-01471-y
Tuyen Van Kieu,Phong Chi Nguyen,Bao Gia Hoang,Khanh Van To
{"title":"Compact SAT encoding for power peak minimization in assembly line balancing","authors":"Tuyen Van Kieu,Phong Chi Nguyen,Bao Gia Hoang,Khanh Van To","doi":"10.1007/s10878-026-01471-y","DOIUrl":"https://doi.org/10.1007/s10878-026-01471-y","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"22 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149049437","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
Greedy approximation for the minimum (1, m)-connected dominating set with labeling 带标记的最小（1,m）连通支配集的贪心逼近
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-09-23 DOI: 10.1007/s10878-026-01474-9
Tianshuo Lv,Bo Hou,Wen Liu,Ke Li
{"title":"Greedy approximation for the minimum (1, m)-connected dominating set with labeling","authors":"Tianshuo Lv,Bo Hou,Wen Liu,Ke Li","doi":"10.1007/s10878-026-01474-9","DOIUrl":"https://doi.org/10.1007/s10878-026-01474-9","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"32 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149021004","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学术文献互助群
群 号：604180095
Book学术官方微信
小红书