Upper bounds and heuristics for the 2-club problem

@article{Carvalho2011UpperBA,
  title={Upper bounds and heuristics for the 2-club problem},
  author={Filipa Duarte de Carvalho and Maria Teresa Almeida},
  journal={European Journal of Operational Research},
  year={2011},
  volume={210},
  pages={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 define facets. These inequalities are the basis of a strengthened formulation for the 2-club problem and a cutting plane algorithm. The LP relaxation of the strengthened formulation is used to compute upper… CONTINUE READING
16 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Strong valid inequalities for the 2-club problem. Centro de Investigação Operacional, Working Paper 2/2008

  • F. D. Carvalho, M. T. Almeida
  • Available at <http:// cio.fc.ul.pt> (accessed…
  • 2008
Highly Influential
6 Excerpts

Strong valid inequalities for the 2 - club problem

  • F. D. Carvalho, M. T. Almeida
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…