arrow
Return

Combinatorial optimization methods in disordered systems

delete1999-09-01
delete3
PRE
AI
S
Sorin Bastea *
A
Artem Burkov
C
Cristian F. Moukarzel
P
P. M. Duxbury
DOI:10.1016/S0010-4655(99)00313-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We give an overview of the applications of methods from combinatorial optimization to problems in disordered systems. The optimization methods are efficient, for example it is possible to find the ground stare of a random field Ising magnet containing one million sites in a couple of minutes on a high end workstation. Combinatorial algorithms for rigidity percolation and minimal energy domain walls in random exchange magnets are even more efficient, (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
GENERIC RIGIDITY PERCOLATION
RANDOM-FIELD SYSTEMS
GROUND-STATE
ZERO-TEMPERATURE
ISING SYSTEMS
MODEL
NETWORKS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computer Physics Communications cover
Computer Physics Communications
IF:
3.4
Papers:
1.2W
Citations:
3.7W

Organization

No organization information available