Journal of Combinatorial Optimization最新文献

{"title":"Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs","authors":"Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer","doi":"10.1007/s10878-024-01204-z","DOIUrl":"https://doi.org/10.1007/s10878-024-01204-z","url":null,"abstract":"<p>In the <span>Vertex Triangle 2-Club</span> problem, we are given an undirected graph <i>G</i> and aim to find a maximum-vertex subgraph of <i>G</i> that has diameter at most 2 and in which every vertex is contained in at least <span>(ell )</span> triangles in the subgraph. So far, the only algorithm for solving <span>Vertex Triangle 2-Club</span> relies on an ILP formulation (Almeida and Brás in Comput Oper Res 111:258–270, 2019). In this work, we develop a combinatorial branch-and-bound algorithm that, coupled with a set of data reduction rules, outperforms the existing implementation and is able to find optimal solutions on sparse real-world graphs with more than 100,000 vertices in a few minutes. We also extend our algorithm to the <span>Edge Triangle 2-Club</span> problem where the triangle constraint is imposed on all edges of the subgraph.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142276008","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}

{"title":"Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights","authors":"Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni","doi":"10.1007/s10878-024-01199-7","DOIUrl":"https://doi.org/10.1007/s10878-024-01199-7","url":null,"abstract":"<p>This paper addresses the minmax regret 1-sink location problem on a dynamic flow path network with parametric weights. A <i>dynamic flow path network</i> consists of an undirected path with positive edge lengths, positive edge capacities, and nonnegative vertex weights. A path can be considered as a road, an edge length as the distance along the road, and a vertex weight as the number of people at the site. An edge capacity limits the number of people that can enter the edge per unit time. We consider the problem of locating a <i>sink</i> where all the people evacuate quickly. In our model, each weight is represented by a linear function of a common parameter <i>t</i>, and the decision maker who determines the sink location does not know the value of <i>t</i>. We formulate the problem under such uncertainty as the <i>minmax regret problem</i>. Given <i>t</i> and sink location <i>x</i>, the cost is the sum of arrival times at <i>x</i> for all the people determined by <i>t</i>. The regret for <i>x</i> under <i>t</i> is the gap between this cost and the optimal cost under <i>t</i>. The problem is to find the sink location minimizing the maximum regret over all <i>t</i>. For the problem, we propose an <span>(O(n^4 2^{alpha (n)} alpha (n)^2 log n))</span> time algorithm, where <i>n</i> is the number of vertices in the network and <span>(alpha (cdot ))</span> is the inverse Ackermann function. Also, for the special case in which every edge has the same capacity, we show that the complexity can be reduced to <span>(O(n^3 2^{alpha (n)} alpha (n) log n))</span>.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084848","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}

{"title":"Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs","authors":"Vladyslav Oles, Nathan Lemons, Alexander Panchenko","doi":"10.1007/s10878-024-01202-1","DOIUrl":"https://doi.org/10.1007/s10878-024-01202-1","url":null,"abstract":"<p>Gromov–Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov–Hausdorff distance is equivalent to solving an NP-hard optimization problem, deeming the notion impractical for applications. In this paper we propose a polynomial algorithm for estimating the so-called modified Gromov–Hausdorff (mGH) distance, a relaxation of the standard Gromov–Hausdorff (GH) distance with similar topological properties. We implement the algorithm for the case of compact metric spaces induced by unweighted graphs as part of Python library <span>scikit-tda</span>, and demonstrate its performance on real-world and synthetic networks. The algorithm finds the mGH distances exactly on most graphs with the scale-free property. We use the computed mGH distances to successfully detect outliers in real-world social and computer networks.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142045389","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}

{"title":"Meta-heuristic-based hybrid deep learning model for vulnerability detection and prevention in software system","authors":"Lijin Shaji, R. Suji Pramila","doi":"10.1007/s10878-024-01185-z","DOIUrl":"https://doi.org/10.1007/s10878-024-01185-z","url":null,"abstract":"<p>Software vulnerabilities are flaws that may be exploited to cause loss or harm. Various automated machine-learning techniques have been developed in preceding studies to detect software vulnerabilities. This work tries to develop a technique for securing the software on the basis of their vulnerabilities that are already known, by developing a hybrid deep learning model to detect those vulnerabilities. Moreover, certain countermeasures are suggested based on the types of vulnerability to prevent the attack further. For different software projects taken as the dataset, feature fusion is done by utilizing canonical correlation analysis together with Deep Residual Network (DRN). A hybrid deep learning technique trained using AdamW-Rat Swarm Optimizer (AdamW-RSO) is designed to detect software vulnerability. Hybrid deep learning makes use of the Deep Belief Network (DBN) and Generative Adversarial Network (GAN). For every vulnerability, its location of occurrence within the software development procedures and techniques of alleviation via implementation level or design level activities are described. Thus, it helps in understanding the appearance of vulnerabilities, suggesting the use of various countermeasures during the initial phases of software design, and therefore, assures software security. Evaluating the performance of vulnerability detection by the proposed technique regarding recall, precision, and f-measure, it is found to be more effective than the existing methods.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142013797","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}

{"title":"The prize-collecting single machine scheduling with bounds and penalties","authors":"Guojun Hu, Pengxiang Pan, Suding Liu, Ping Yang, Runtao Xie","doi":"10.1007/s10878-024-01203-0","DOIUrl":"https://doi.org/10.1007/s10878-024-01203-0","url":null,"abstract":"<p>This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of <i>n</i> jobs and a single machine are considered, where each job <span>(J_j)</span> has a processing time <span>(p_{j})</span>, a profit <span>(pi _{j})</span> and a rejection penalty <span>(w_{j})</span>. The upper bound on the processing number is <i>U</i>. The objective of this study is to find a feasible schedule that minimizes the makespan of the accepted jobs and the total rejection penalty of the rejected jobs under the condition that the number of the accepted jobs does not exceed a given threshold <i>U</i> while the total profit of the accepted jobs does not fall below a specified profit bound <span>(varPi )</span>. We first demonstrate that this problem is <i>NP</i>-hard. Then, a pseudo-polynomial time dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS) are proposed. Finally, numerical experiments are conducted to compare the effectiveness of the two proposed algorithms.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141994521","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}

{"title":"On the complexity of minimum maximal acyclic matchings","authors":"Juhi Chaudhary, Sounaka Mishra, B. S. Panda","doi":"10.1007/s10878-024-01200-3","DOIUrl":"https://doi.org/10.1007/s10878-024-01200-3","url":null,"abstract":"<p><span>Low-Acy-Matching</span> asks to find a maximal matching <i>M</i> in a given graph <i>G</i> of minimum cardinality such that the set of <i>M</i>-saturated vertices induces an acyclic subgraph in <i>G</i>. The decision version of <span>Low-Acy-Matching</span> is known to be <span>({textsf{NP}})</span>-complete. In this paper, we strengthen this result by proving that the decision version of <span>Low-Acy-Matching</span> remains <span>({textsf{NP}})</span>-complete for bipartite graphs with maximum degree 6 and planar perfect elimination bipartite graphs. We also show the hardness difference between <span>Low-Acy-Matching</span> and <span>Max-Acy-Matching</span>. Furthermore, we prove that, even for bipartite graphs, <span>Low-Acy-Matching</span> cannot be approximated within a ratio of <span>(n^{1-epsilon })</span> for any <span>(epsilon &gt;0)</span> unless <span>({textsf{P}}={textsf{NP}})</span>. Finally, we establish that <span>Low-Acy-Matching</span> exhibits <span>(textsf{APX})</span>-hardness when restricted to 4-regular graphs.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141899467","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}

{"title":"Polynomial algorithms for sparse spanners on subcubic graphs","authors":"R. Gómez, F. K. Miyazawa, Y. Wakababayashi","doi":"10.1007/s10878-024-01197-9","DOIUrl":"https://doi.org/10.1007/s10878-024-01197-9","url":null,"abstract":"<p>Let <i>G</i> be a connected graph and <span>(t ge 1)</span> a (rational) constant. A <i>t</i>-<i>spanner</i> of <i>G</i> is a spanning subgraph of <i>G</i> in which the distance between any pair of vertices is at most <i>t</i> times its distance in <i>G</i>. We address two problems on spanners. The first one, known as the <i>minimum</i> <i>t</i>-<i>spanner problem</i> (<span>MinS</span> <span>(_t)</span>), seeks in a connected graph a <i>t</i>-spanner with the smallest possible number of edges. In the second one, called <i>minimum cost tree</i> <i>t</i>-<i>spanner problem</i> (<span>MCTS</span> <span>(_t)</span>), the input graph has costs assigned to its edges and seeks a <i>t</i>-spanner that is a tree with minimum cost. It is an optimization version of the <i>tree</i> <i>t</i>-<i>spanner problem</i> (<span>TreeS</span> <span>(_t)</span>), a decision problem concerning the existence of a <i>t</i>-spanner that is a tree. <span>MinS</span> <span>(_t)</span> is known to be <span>({textsc {NP}})</span>-hard for every <span>(t ge 2)</span>. On the other hand, <span>TreeS</span> <span>(_t)</span> admits a polynomial-time algorithm for <span>(t le 2)</span> and is <span>({textsc {NP}})</span>-complete for <span>(t ge 4)</span>; but its complexity for <span>(t=3)</span> remains open. We focus on the class of subcubic graphs. First, we show that for such graphs <span>MinS</span> <span>(_3)</span> can be solved in polynomial time. These results yield a practical polynomial algorithm for <span>TreeS</span> <span>(_3)</span> that is of a combinatorial nature. We also show that <span>MCTS</span> <span>(_2)</span> can be solved in polynomial time. To obtain this last result, we prove a complete linear characterization of the polytope defined by the incidence vectors of the tree 2-spanners of a subcubic graph. A recent result showing that <span>MinS</span> <span>(_3)</span> on graphs with maximum degree at most 5 is NP-hard, together with the current result on subcubic graphs, leaves open only the complexity of <span>MinS</span> <span>(_3)</span> on graphs with maximum degree 4.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141899478","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}

{"title":"Approximating the probabilistic p-Center problem under pressure","authors":"Marc Demange, Marcel A. Haddad, Cécile Murat","doi":"10.1007/s10878-024-01194-y","DOIUrl":"https://doi.org/10.1007/s10878-024-01194-y","url":null,"abstract":"<p>The Probabilistic <i>p</i>-Center problem under Pressure (<span>Min P</span> <i>p</i> <span>CP</span>) is a variant of the usual <span>Min</span> <i>p</i><span>-Center</span> problem we recently introduced in the context of wildfire management. The problem is to locate <i>p</i> shelters minimizing the maximum distance people will have to cover in case of fire in order to reach the closest accessible shelter. The landscape is divided into zones and is modeled as an edge-weighted graph with vertices corresponding to zones and edges corresponding to direct connections between two adjacent zones. The risk associated with fire outbreaks is modeled using a finite set of fire scenarios. Each scenario corresponds to a fire outbreak on a single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways. First, an evacuation path cannot pass through the vertex on fire. Second, the fact that someone close to the fire may not take rational decisions when selecting a direction to escape is modeled using new kinds of evacuation paths. In this paper, we characterize the set of feasible solutions of <span>Min P</span> <i>p</i> <span>CP</span>-instance. Then, we propose some approximation results for <span>Min P</span> <i>p</i> <span>CP</span>. These results require approximation results for two variants of the (deterministic) <span>Min</span> <i>p</i><span>-Center</span> problem called <span>Min MAC</span> <i>p</i><span>-Center</span> and <span>Min Partial</span> <i>p</i><span>-Center</span>.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141899477","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}

{"title":"Models for two-dimensional bin packing problems with customer order spread","authors":"Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos, Reinaldo Morabito","doi":"10.1007/s10878-024-01201-2","DOIUrl":"https://doi.org/10.1007/s10878-024-01201-2","url":null,"abstract":"<p>In this paper, we address an extension of the classical two-dimensional bin packing (2BPP) that considers the spread of customer orders (2BPP-OS). The 2BPP-OS addresses a set of rectangular items, required from different customer orders, to be cut from a set of rectangular bins. All the items of a customer order are dispatched together to the next stage of production or distribution after its completion. The objective is to minimize the number of bins used and the spread of customer orders over the cutting process. The 2BPP-OS gains relevance in manufacturing environments that seek minimum waste solutions with satisfactory levels of customer service. We propose integer linear programming (ILP) models for variants of the 2BPP-OS that consider non-guillotine, 2-stage, restricted 3-stage, and unrestricted 3-stage patterns. We are not aware of integrated approaches for the 2BPP-OS in the literature despite its relevance in practical settings. Using a general-purpose ILP solver, the results show that the 2BPP-OS takes more computational effort to solve than the 2BPP, as it has to consider several symmetries that are often disregarded by the traditional 2BPP approaches. The solutions obtained by the proposed approaches have similar bin usage and significantly better metrics of customer satisfaction concerning the approaches that neglect the customer order spread.\u0000</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141899468","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}

{"title":"Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets","authors":"Fatemeh Ehsani, Monireh Hosseini","doi":"10.1007/s10878-024-01196-w","DOIUrl":"https://doi.org/10.1007/s10878-024-01196-w","url":null,"abstract":"<p>With the advancement of electronic service platforms, customers exhibit various purchasing behaviors. Given the extensive array of options and minimal exit barriers, customer migration from one digital service to another has become a common challenge for businesses. Customer churn prediction (CCP) emerges as a crucial marketing strategy aimed at estimating the likelihood of customer abandonment. In this paper, we aim to predict customer churn intentions using a novel robust meta-classifier. We utilized three distinct datasets: transaction, telecommunication, and customer churn datasets. Employing Decision Tree, Random Forest, XGBoost, AdaBoost, and Extra Trees as the five base supervised classifiers on these three datasets, we conducted cross-validation and evaluation setups separately. Additionally, we employed permutation and SelectKBest feature selection to rank the most practical features for achieving the highest accuracy. Furthermore, we utilized BayesSearchCV and GridSearchCV to discover, optimize, and tune the hyperparameters. Subsequently, we applied the refined classifiers in a funnel of a new meta-classifier for each dataset individually. The experimental results indicate that our proposed meta-classifier demonstrates superior accuracy compared to conventional classifiers and even stacking ensemble methods. The predictive outcomes serve as a valuable tool for businesses in identifying potential churners and taking proactive measures to retain customers, thereby enhancing customer retention rates and ensuring business sustainability.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141880238","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}