Tor Myklebust

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compare its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, Mc-Geoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but(More)
  • 1