On the minimum-cost $$\lambda $$ λ -edge-connected k-subgraph problem

Abstract

In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost $$\lambda $$ -edge-connected k-subgraph problem, or the $$(k,\lambda )$$ -subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if $$\lambda =1$$ ), $$\lambda $$ -edge-connected spanning subgraph problem (if $$k=|V|$$ ) and k-clique problem (if $$\lambda = k-1$$ and there are exact k vertices in the subgraph). As a generalization of k-minimum spanning tree and a case of the $$(k,\lambda )$$ -subgraph problem, the (k, 2)-subgraph problem is studied, and some special graph properties are proved to find stronger and more compact IP formulations. Additionally, we study the valid inequalities for these IP formulations. Numerical experiments are performed to compare proposed IP formulations and inequalities.