Carvalho, Filipa D.; Almeida, M. Teresa - In: European Journal of Operational Research 210 (2011) 3, pp. 489-494
Given an undirected graph G = (V, E), a k-club is a subset of V that induces a subgraph of diameter at most k. The k-club problem is that of finding the maximum cardinality k-club in G. In this paper we present valid inequalities for the 2-club polytope and derive conditions for them to...