Publication:4328701
From MaRDI portal
zbMath1003.82002MaRDI QIDQ4328701
Heiko Rieger, Alexander K. Hartmann
Publication date: 29 April 2002
complexity; matching; ground state; Monte Carlo methods; genetic algorithms; graph algorithms; spin glass; branch-and-bound methods
90C90: Applications of mathematical programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C60: Abstract computational complexity for mathematical programming problems
90C15: Stochastic programming
90C27: Combinatorial optimization
00A79: Physics
82-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistical mechanics
Related Items
Эффективная вычислительная процедура альтернансного метода оптимизации, Maximum Entropy Bi-Objective Model and its Evolutionary Algorithm for Portfolio Optimization, Game-theoretical approach for task allocation problems with constraints, Massively parallel simulations for disordered systems, An accelerated procedure for solving binary optimization problems, Partitioning planar graphs: a fast combinatorial approach for max-cut, Matrix-power energy-landscape transformation for finding NP-hard spin-glass ground states, Positive role of glassy dynamics in finite-time optimization by threshold algorithms, Quantifying entanglement of two relativistic particles using optimal entanglement witness, Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture, Application of exact combinatorial optimization algorithms to the physics of disordered systems, A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions, Low-energy excitations in the three-dimensional random-field Ising model, Gradient surfing: a new deterministic approach for low-dimensional global optimization, Evolutionary accessibility in tunably rugged fitness landscapes, Percolation and Schramm-Loewner evolution in the 2D random-field Ising model, Increasing the attraction area of the global minimum in the binary optimization problem, Colloquium: Quantum annealing and analog quantum computation, Quantum Approach to Classical Statistical Mechanics
Uses Software
