An exact algorithm for graph partitioning

@article{Hager2013AnEA,
  title={An exact algorithm for graph partitioning},
  author={William W. Hager and Dzung T. Phan and Hongchao Zhang},
  journal={Math. Program.},
  year={2013},
  volume={137},
  pages={531-556}
}
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
20 Citations
43 References
Similar Papers

Citations

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

References

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

C

  • C. E. Ferreira, A. Martin
  • C. de Souza, R. Weismantel, and L. A. Wolsey, The…
  • 1998
Highly Influential
5 Excerpts

Two point step size gradient methods

  • J. Barzilai, J. M. Borwein
  • IMA J. Numer. Anal., 8
  • 1988
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…