Calculating exact ground states of spin glasses: A polyhedral approach
Data up to Jan 2025
Total Citations Per Year
Abstract
References (39)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Reducibility among Combinatorial Problems
1972 • 10,743 citations
Geometric Algorithms and Combinatorial Optimization
1988 • 3,622 citations
Complexity of Computer Computations
1972 • 2,804 citations
The ellipsoid method and its consequences in combinatorial optimization
1981 • 2,062 citations
Solution of a Large-Scale Traveling-Salesman Problem
2009 • 1,314 citations
On the computational complexity of Ising spin glass models
1982 • 1,248 citations
Solution of a Large-Scale Traveling-Salesman Problem
1954 • 1,141 citations
Matching, Euler tours and the Chinese postman
1973 • 979 citations
Traveling Salesman Problem
1986 • 805 citations
Solving Large-Scale Zero-One Linear Programming Problems
1983 • 675 citations
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
1988 • 484 citations
Node-and edge-deletion NP-complete problems
1978 • 457 citations
Finding a Maximum Cut of a Planar Graph in Polynomial Time
1975 • 403 citations
On the cut polytope
1986 • 385 citations
A Cutting Plane Algorithm for the Linear Ordering Problem
1984 • 316 citations
Magnetic correlations in two-dimensional spin-glasses
1980 • 301 citations
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
1980 • 301 citations
Minimum cuts and related problems
1975 • 250 citations
On the symmetric travelling salesman problem I: Inequalities
1979 • 212 citations
Theory of the frustration effect in spin glasses: I
1986 • 184 citations
Weakly bipartite graphs and the Max-cut problem
1981 • 173 citations
Heidelberg Colloquium on Spin Glasses
1983 • 167 citations
On the symmetric travelling salesman problem II: Lifting theorems and facets
1979 • 157 citations
Morphology of ground states of two-dimensional frustration model
1982 • 152 citations
The max-cut problem on graphs not contractible to K5
1983 • 151 citations
Solving matching problems with linear programming
1985 • 93 citations
Communications in Physics
1997 • 84 citations
Facets of the Bipartite Subgraph Polytope
1985 • 81 citations
Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme
1977 • 73 citations
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
1984 • 40 citations
A recursive branch-and-bound algorithm for the exact ground state of Ising spin-glass models
1984 • 34 citations
On the exact ground states of three-dimensional Ising spin glasses
1982 • 25 citations
Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
1985 • 23 citations
Finding ground states in random-field Ising ferromagnets
1985 • 20 citations
On the random antiphase state in the ± J spin glass model in two dimensions
1984 • 16 citations
Frustration and disorder new problems in statistical mechanics spin glasses in a historical perspective
1983 • 8 citations
Numerical simulations of spin glasses
1983 • 6 citations
Deleted Work
1955 • 0 citations