REVIEW 2 cited by
Solving maximum cut problems by simulated annealing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to find better solutions than were previously known for 40 of the 89 standard maximum cut instances tested within a few minutes of computation.
Forward citations
Cited by 2 Pith papers
-
HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges
An LLM-driven two-stage hyper-heuristic framework that evolves a pool of heuristics and adaptively selects among them, outperforming prior LLM hyper-heuristics on TSP, CVRP, MKP, and JSSP.
-
Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
On 139 Max-Cut instances, classical simulated annealing and Toshiba's SBM match or beat D-Wave's Hybrid solver on large graphs, and the fast-annealing QPU misses the global optimum on nearly all small instances.
Discussion (0). Continue with ORCID to comment.