Pub Date : 2025-12-01DOI: 10.1007/s10878-025-01365-5
Baruch Mor, Gur Mosheiov, Dana Shapira
{"title":"Single machine lot scheduling with maintenance activity","authors":"Baruch Mor, Gur Mosheiov, Dana Shapira","doi":"10.1007/s10878-025-01365-5","DOIUrl":"https://doi.org/10.1007/s10878-025-01365-5","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"72 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145657517","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 : 2025-11-29DOI: 10.1007/s10878-025-01367-3
Levi R. Abreu, Bruno A. Prata
{"title":"A comparative computational study for parallel-machine problems with sustainable manufacturing constraints","authors":"Levi R. Abreu, Bruno A. Prata","doi":"10.1007/s10878-025-01367-3","DOIUrl":"https://doi.org/10.1007/s10878-025-01367-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"19 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619669","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 : 2025-11-29DOI: 10.1007/s10878-025-01360-w
M. A. Shalu, V. K. Kirubakaran
{"title":"Total domination and open packing in some subclasses of bipartite graphs","authors":"M. A. Shalu, V. K. Kirubakaran","doi":"10.1007/s10878-025-01360-w","DOIUrl":"https://doi.org/10.1007/s10878-025-01360-w","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"25 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619670","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 : 2025-11-29DOI: 10.1007/s10878-025-01375-3
Maria Luiza L. da Cruz, Raquel Bravo, Rodolfo A. Oliveira, Ueverton S. Souza
{"title":"Near-bipartiteness on graphs having small dominating sets","authors":"Maria Luiza L. da Cruz, Raquel Bravo, Rodolfo A. Oliveira, Ueverton S. Souza","doi":"10.1007/s10878-025-01375-3","DOIUrl":"https://doi.org/10.1007/s10878-025-01375-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"25 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619671","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 : 2025-11-08DOI: 10.1007/s10878-025-01371-7
Giovanni Pantuso
This article describes a model and an exact solution method for facility location problems with decision-dependent uncertainties. The model allows characterizing the probability distribution of the random elements as a function of the choice of open facilities. This, in turn, generates a combinatorial number of potential distributions of the random elements. Though general in the relationship between location decisions and distributions, the proposed model is, however, exponential in size. We show that the problem can be solved efficiently by a recent finitely convergent method for stochastic programs with decision-dependent uncertainty, for which we prove tight cutting planes and effective valid inequalities. Extensive tests show that facility location problems with up to $$2^{17}$$ potential distributions and hundreds of thousand scenarios are solved within minutes. These results indentify a promising solution strategy for other combinatorial optimization problems characterized by decision-dependent uncertanty.
{"title":"Solution of stochastic facility location problems with combinatorially many decision-dependent distributions","authors":"Giovanni Pantuso","doi":"10.1007/s10878-025-01371-7","DOIUrl":"https://doi.org/10.1007/s10878-025-01371-7","url":null,"abstract":"This article describes a model and an exact solution method for facility location problems with decision-dependent uncertainties. The model allows characterizing the probability distribution of the random elements as a function of the choice of open facilities. This, in turn, generates a combinatorial number of potential distributions of the random elements. Though general in the relationship between location decisions and distributions, the proposed model is, however, exponential in size. We show that the problem can be solved efficiently by a recent finitely convergent method for stochastic programs with decision-dependent uncertainty, for which we prove tight cutting planes and effective valid inequalities. Extensive tests show that facility location problems with up to <jats:inline-formula> <jats:tex-math>$$2^{17}$$</jats:tex-math> </jats:inline-formula> potential distributions and hundreds of thousand scenarios are solved within minutes. These results indentify a promising solution strategy for other combinatorial optimization problems characterized by decision-dependent uncertanty.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"21 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145472692","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 : 2025-11-08DOI: 10.1007/s10878-025-01369-1
Nilanjana Karmakar, Arindam Biswas
{"title":"Face recognition using life-centroid distance between featured persistence diagrams","authors":"Nilanjana Karmakar, Arindam Biswas","doi":"10.1007/s10878-025-01369-1","DOIUrl":"https://doi.org/10.1007/s10878-025-01369-1","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"52 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145472691","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 : 2025-11-02DOI: 10.1007/s10878-025-01354-8
Sangram K. Jena, K. Subramani, Alvaro Velasquez
{"title":"Advancing discrete optimization: novel approaches with dataless neural networks","authors":"Sangram K. Jena, K. Subramani, Alvaro Velasquez","doi":"10.1007/s10878-025-01354-8","DOIUrl":"https://doi.org/10.1007/s10878-025-01354-8","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"4 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145427579","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 : 2025-10-25DOI: 10.1007/s10878-025-01368-2
Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński, Michał Zakrzewski, Paweł Żyliński
We present a simple linear-time algorithm that finds a spanning tree T of a given 2-edge-connected graph G such that each vertex v of T has degree at most $$lceil frac{deg _G(v)}{2}rceil + 1$$ .
{"title":"Low-degree spanning trees of 2-edge-connected graphs in linear time","authors":"Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński, Michał Zakrzewski, Paweł Żyliński","doi":"10.1007/s10878-025-01368-2","DOIUrl":"https://doi.org/10.1007/s10878-025-01368-2","url":null,"abstract":"We present a simple linear-time algorithm that finds a spanning tree <jats:italic>T</jats:italic> of a given 2-edge-connected graph <jats:italic>G</jats:italic> such that each vertex <jats:italic>v</jats:italic> of <jats:italic>T</jats:italic> has degree at most <jats:inline-formula> <jats:tex-math>$$lceil frac{deg _G(v)}{2}rceil + 1$$</jats:tex-math> </jats:inline-formula> .","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145382460","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
扫码关注我们
求助内容：
应助结果提醒方式：