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

Journal of Combinatorial Optimization最新文献

筛选
英文 中文
Single Machine Scheduling with Precedence Constraints and Bounded Maximum Delay Value 具有优先约束和有界最大延迟值的单机调度
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-03-03 DOI: 10.1007/s10878-026-01411-w
Maher Mallem, Claire Hanen, Alix Munier-Kordon
{"title":"Single Machine Scheduling with Precedence Constraints and Bounded Maximum Delay Value","authors":"Maher Mallem, Claire Hanen, Alix Munier-Kordon","doi":"10.1007/s10878-026-01411-w","DOIUrl":"https://doi.org/10.1007/s10878-026-01411-w","url":null,"abstract":"We consider single machine scheduling problems minimizing the makespan when tasks are subject to precedence constraints with minimum, exact or maximum delays. We investigate the parameterized complexity of these problems with respect to the maximum delay value <inline-formula><alternatives><mml:math><mml:msub><mml:mi>ℓ</mml:mi><mml:mrow><mml:mi mathvariant=\"italic\">max</mml:mi></mml:mrow></mml:msub></mml:math><tex-math>documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$ell _{max}$$end{document}</tex-math></alternatives></inline-formula>, and we complement the landscape of results in this field.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"20 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147507831","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 systematic review of recent advances in snake optimizer algorithm 系统综述了蛇形优化算法的最新进展
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-20 DOI: 10.1007/s10878-026-01403-w
Moh Nur Sholeh, Undayani Cita Sari
{"title":"A systematic review of recent advances in snake optimizer algorithm","authors":"Moh Nur Sholeh, Undayani Cita Sari","doi":"10.1007/s10878-026-01403-w","DOIUrl":"https://doi.org/10.1007/s10878-026-01403-w","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230751","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 Parallel Batch Machine Scheduling of Malleable Jobs 可塑作业并行批处理调度的近似算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-20 DOI: 10.1007/s10878-026-01391-x
Fenghe Xia, Longkun Guo, Xiaoyan Zhang
{"title":"Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs","authors":"Fenghe Xia, Longkun Guo, Xiaoyan Zhang","doi":"10.1007/s10878-026-01391-x","DOIUrl":"https://doi.org/10.1007/s10878-026-01391-x","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230755","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 Modified non-monotone adaptive retrospective trust region algorithm for unconstrained optimization 一种改进的无约束优化非单调自适应回溯信赖域算法
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-20 DOI: 10.1007/s10878-026-01404-9
Seyed Hamzeh Mirzaei, Ali Ashrafi
{"title":"A Modified non-monotone adaptive retrospective trust region algorithm for unconstrained optimization","authors":"Seyed Hamzeh Mirzaei, Ali Ashrafi","doi":"10.1007/s10878-026-01404-9","DOIUrl":"https://doi.org/10.1007/s10878-026-01404-9","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"320 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230756","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
(Pareto)-Optimization and greedy algorithm-based solutions for review and panel assignments （帕累托）-优化和贪婪算法为基础的解决方案的审查和小组分配
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-20 DOI: 10.1007/s10878-026-01401-y
Rohit Ramachandran, Urjit Patil, Abhinav De
{"title":"(Pareto)-Optimization and greedy algorithm-based solutions for review and panel assignments","authors":"Rohit Ramachandran, Urjit Patil, Abhinav De","doi":"10.1007/s10878-026-01401-y","DOIUrl":"https://doi.org/10.1007/s10878-026-01401-y","url":null,"abstract":"This study focuses on developing hybrid methods for the optimal and feasible solution of the panel assignment problem (PAP), which involves the fair allocation of proposals to reviewers while satisfying various constraints. The PAP is a complex combinatorial optimization problem that requires balancing fairness, efficiency, and computational feasibility. In this work, a combination of integer optimization techniques, Pareto-optimality principles, and Greedy algorithms are explored to address the challenges of panel assignment. Optimization-based methods, particularly integer programming approaches, demonstrate strong performance in identifying optimal solutions and consistently outperform previously published case studies in terms of solution quality. These methods excel at ensuring fairness and constraint satisfaction but can be computationally expensive for large-scale instances. On the other hand, Greedy algorithms provide a more computationally efficient alternative. Two variations of Greedy methods are examined: one that prioritizes solution quality at the cost of increased computational time and another that sacrifices optimality to achieve enhanced computational efficiency whilst still ensuring feasibility. Our findings indicate that while an optimized Greedy algorithm can yield near-optimal solutions, a more relaxed version offers a pragmatic balance between solution quality and computational efficiency. Additionally results show how Pareto-optimality can guide decision-making finding a balance between global optimality and maximizing commonality among reviewers who review the same proposal. The demonstrated methods and results provide valuable insights into how hybrid strategies can be tailored for practical panel assignment applications, ensuring both fairness and efficiency in panel assignment scenarios.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"281 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230770","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 TWKHM conjecture on the number of walks in trees 关于树上行走次数的TWKHM猜想
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-20 DOI: 10.1007/s10878-026-01399-3
Dongxiu Cai, Jiasheng Zeng, Xiao-Dong Zhang
{"title":"The TWKHM conjecture on the number of walks in trees","authors":"Dongxiu Cai, Jiasheng Zeng, Xiao-Dong Zhang","doi":"10.1007/s10878-026-01399-3","DOIUrl":"https://doi.org/10.1007/s10878-026-01399-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"15 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146230754","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
Stable matching with approval preferences under partial information 部分信息下与审批偏好的稳定匹配
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-09 DOI: 10.1007/s10878-026-01392-w
Yaqin Chu, Junjie Luo, Tianyang Zheng
{"title":"Stable matching with approval preferences under partial information","authors":"Yaqin Chu, Junjie Luo, Tianyang Zheng","doi":"10.1007/s10878-026-01392-w","DOIUrl":"https://doi.org/10.1007/s10878-026-01392-w","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"39 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146145937","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 maximizing k-submodular functions under p-system and d-knapsack constraints 关于p系统和d背包约束下k次模函数的最大化
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-09 DOI: 10.1007/s10878-026-01395-7
Wenzhe Zhang, Shufang Gong, Bin Liu, Qian Liu, Priyanshi Garg
{"title":"On maximizing k-submodular functions under p-system and d-knapsack constraints","authors":"Wenzhe Zhang, Shufang Gong, Bin Liu, Qian Liu, Priyanshi Garg","doi":"10.1007/s10878-026-01395-7","DOIUrl":"https://doi.org/10.1007/s10878-026-01395-7","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146145938","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 fault-tolerant dynamic graph attention network for energy efficient routing and reliability in wireless sensor networks 面向无线传感器网络节能路由和可靠性的容错动态图关注网络
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-09 DOI: 10.1007/s10878-026-01396-6
G. V. Soni Meera, R. Isaac Sajan
{"title":"A fault-tolerant dynamic graph attention network for energy efficient routing and reliability in wireless sensor networks","authors":"G. V. Soni Meera, R. Isaac Sajan","doi":"10.1007/s10878-026-01396-6","DOIUrl":"https://doi.org/10.1007/s10878-026-01396-6","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"18 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146145939","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 positive influence dominating sets with bi-directional weighted constraint in social networks 社会网络中具有双向加权约束的正影响支配集
IF 1 4区 数学
Journal of Combinatorial Optimization Pub Date : 2026-02-09 DOI: 10.1007/s10878-026-01398-4
Qi Zhang, Hao Zhong
{"title":"On positive influence dominating sets with bi-directional weighted constraint in social networks","authors":"Qi Zhang, Hao Zhong","doi":"10.1007/s10878-026-01398-4","DOIUrl":"https://doi.org/10.1007/s10878-026-01398-4","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"70 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146145941","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学术官方微信
小红书