Pub Date : 2026-02-09DOI: 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}
Pub Date : 2026-02-09DOI: 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}
Pub Date : 2026-01-23DOI: 10.1007/s10878-025-01376-2
David Könen, Michael Stiglmayr
This paper addresses the output-sensitive 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 $$textbf{P}=textbf{N P}$$ . 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 $$varepsilon $$ -constraint scalarization approach is introduced, demonstrating enhanced efficiency in the numerical tests.
{"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}
Pub Date : 2026-01-11DOI: 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}
Pub Date : 2026-01-11DOI: 10.1007/s10878-025-01385-1
Byung-Cheon Choi, Myoung-Ju Park
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：