Login / Signup
A note on the 2-circulant inequalities for the max-cut problem.
Konstantinos Kaparis
Adam N. Letchford
Published in:
Oper. Res. Lett. (2018)
Keyphrases
</>
max cut
planar graphs
sufficient conditions
least squares
linear inequalities
fourier transform
cross entropy
neural network
image processing
random graphs
valid inequalities
cutting plane algorithm
genetic algorithm
dynamic programming
onset detection
facet defining