Login / Signup
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances.
Luigi Grippo
Laura Palagi
Mauro Piacentini
Veronica Piccialli
Giovanni Rinaldi
Published in:
Math. Program. (2012)
Keyphrases
</>
worst case
max cut
np hard
randomly generated
lower and upper bounds
objective function
k means
computational complexity
simulated annealing
segmentation algorithm
lower bound
pairwise
search space
evolutionary algorithm
similarity measure
probabilistic model
upper bound
optimal solution
graph model