Using network-flow techniques to solve an optimization problem from surface-physics

Journal of Physics A: Mathematical and General

Volumn 29, Issue 18, 1996, Pages

  Blasum, U ^a   Hochstattler W ^a   Moll, C ^a   Rieger, H ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b FORSCHUNGSZENTRUM JÜLICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343793224     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/29/18/003     Document Type: Article

References (14)

1. Bieche I, Maynard R, Rammal R and Uhry J P 1980 On the ground states of the frustration model of a spin glass by a matching method of graph theory J. Phys. A: Math. Gen. 13 2553-76
2. Barahona F, Grötschel M, Jünger M and Reinelt G 1988 An application of combinatorial optimization to statistical physics and circuit layout design Combinatorial Optimization 36 493-513
3. De Simone C, Reinelt M, Jünger M, Mutzel P, Reinelt G and Rinaldi G 1995 Exact ground states of Ising spin glasses: New experimental results with a branch and cut algorithm J. Stat. Phys. 80 487-96
4. Barahona F 1985 Finding ground states in random-field Ising ferromagnets J. Phys. A: Math. Gen. 18 L673-5
5. Lagally M G 1990 Kinetics of Ordering and Growth at Surfaces (New York: Plenum)
6. Burton W K, Cabrera N and Frank F C 1951 Phil. Trans. R. Soc. A 243 299
7. Chui S T and Weeks J D 1976 Phase transition in the two-dimensional Coulomb gas and the interfacial roughening transition Phys. Rev. B 14 4978-82
8. Toner J and Di Vinzenzo D J 1990 Super-roughening: A new phase transition on the surfaces of crystals with quenched bulk disorder Phys. Rev. B 41 632-50
9. Tsai Y C and Shapir Y 1992 Kinetic roughening in surfaces of crystals growing on disordered substrates Phys. Rev. Lett. 69 1773
10. Marinari E, Monasson R and Ruiz-Lorenzo J J 1995 How (super)-rough is the glassy phase of a crystalline surface with a disordered substrate? J. Phys. A: Math. Gen. 28 3975
11. Minoux M 1986 Solving integer minimum cost flows with separable convex cost objective polynomially Math. Prog. Study 26 237-9
12. Berge C 1985 Graphs (Amsterdam: North-Holland)
13. Ahuja R, Magnanti T and Orlin J 1993 Network Flows (Englewood Cliffs, NJ: Prentice-Hall)
14. Näher S and Uhrig C 1995 The LEDA User Manual, Version R3.2 (Saarbrücken: Max-Planck-Institut für Informatik)