Algorithm Profiling

In recent years, several very efficient exact optimization algorithms have
been developed in the computer science community. Examples are maximum flow
algorithms, minimum-cost flow techniques, matching methods, which all are graph
theoretical approaches or sophisticated branch-and-cut methods, originating in
the field of linear optimization. These algorithms have now been applied to
problems from physics like for random magnetic materials (random-field systems,
spin glasses), in surface physics (solid-on-solid models) and many other
disordered systems. The system sizes which can be treated are now much larger
than ten years before, allowing the obtain now more reliable and higher
significant data.

by

Gautam958(deoghar)