Pub Date : 2026-10-17DOI: 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}
Pub Date : 2026-10-16DOI: 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}
Pub Date : 2026-10-16DOI: 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}
Pub Date : 2026-10-15DOI: 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}
Pub Date : 2026-10-01DOI: 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}
Pub Date : 2026-09-26DOI: 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}
Pub Date : 2026-09-26DOI: 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}
Pub Date : 2026-09-23DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：