Author:
Anjos Miguel F.,Neto José
Funder
Investissement d’avenir project
Gaspard Monge Program
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. Solving k-way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method;Anjos,2013
2. A Class of Spectral Bounds for Max K-Cut;Anjos,2018
3. A new heuristic for partitioning the nodes of a graph;Barnes;SIAM J. Discrete Math.,1988
4. Spectral bounds for the maximum cut problem;Ben-Ameur;Networks,2008
5. Spectral bounds for unconstrained (−1,1)-quadratic optimization problems;Ben-Ameur;European J. Oper. Res.,2010