From cophywiki
Jump to: navigation, search

L. Saul, M. Kardar 1994: The 2D \pm J Ising spin glass: exact partition functions in polynomial time. Nuclear Physics B 432, 641-667.

A. Galluccio, M. Loebl, J. Vondrak 2001: Optimization via Enumeration: a new algorithm for the Max Cut Problem. Mathematical Programming 90, 273-290.

F. Barahona 1982: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15, 3241-3253.

M. X.Goemans, D. P.Williamson 1994: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. ACM, 422-431.

M. Deza, M. Laurent,: Geometry of Cuts and Metrics. Springer-Verlag, Berlin year = 1997.

F. Barahona 1983: The MAX-CUT Problem on Graphs not Contractible to K5. Operations Research Letters 2, 107-111.

Weyl, H. 1935: Elementare Theorie der konvexen Polyeder. Comment. Math. Helvetici.

Minkowski, H. 1897: Allgemeine Lehrsätze über die konvexe Polyeder. Nachr. Ges. Wiss., Göttingen, 198-219.

Bieche, L., Uhry, J.P., Maynard, R., Rammal, R. (1980): On the ground states of the frustration model of a spin glass by a matching method of graph theory.

Fisher, Michael E. 1966: On the Dimer Solution of Planar Ising Models. Journal of Mathematical Physics 7/10, 1776-1781.

Hartmann, Alexander K. 1999: Ground-state landscape of 2d +-J Ising spin glasses. The European Physical Journal B 8, 619.

John Hertz (1998): Spin Glass Physics.

Landry, J. W., Coppersmith, S. N. 2002: Ground states of two-dimensional +/-J Edwards-Anderson spin glasses. \prb 65/13, 134404-+.

Kasteleyn,P. W. 1963: Dimer Statistics and Phase Transitions. Journal of Mathematical Physics 4/2, 287-293.

Palmer, R.G., Adler, J. 1999: Ground States for Large Samples of Two-Dimensional Ising Spin Glasses. International Journal of Modern Physics C 10, 667-675.

Pardella, Gregor, Liers, Frauke 2008: Exact Ground States of Large Two-Dimensional Planar Ising Spin Glasses. Physical Review E 78/5, 056705(10).

Rieger, H. (1998): Frustrated systems: Ground state properties via combinatorial optimization.

Thomas, Creighton K., Middleton, A. Alan 2007: Matching Kasteleyn cities for spin glass ground states. Physical Review B (Condensed Matter and Materials Physics) 76/22, 220406.

Ahuja, Ravindra K., Magnanti, Thomas L., Orlin, James B. 1993: Network flows. Englewood Cliffs, NJ: Prentice Hall Inc. Theory, algorithms, and applications.

Cook, William J., Cunningham, William H., Pulleyblank, William R., Schrijver, Alexander 1998: Combinatorial optimization. New York: John Wiley & Sons Inc. A Wiley-Interscience Publication.

Cook, W., Rohe, A. 1999: Computing minimum-weight perfect matchings. INFORMS Journal on Computing 11, 138–148.

Edsger W. Dijkstra 1959: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271.

Goldberg, A V, Tarjan, R E (1986): A new approach to the maximum flow problem. New York, NY, USA: ACM.

Frank Harary (1989): The geometric dual of a graph. New York, NY, USA: New York Academy of Sciences.

Eugene Lawler 2001: Combinatorial Optimization: Networks and Matroids. Dover Publications Inc.

Lovász, László, Plummer, Michael D. 2009: Matching theory. AMS Chelsea Publishing, Providence, RI. Corrected reprint of the 1986 original.

Kolmogorov, Vladimir 2009: Blossom V: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation 1/1, 43–67.

Oxley, James G. 1992: Matroid theory. New York: The Clarendon Press Oxford University Press.

Picard, J. C., Queyranne, M. 1982: Selected applications of minimum cuts in networks. Information Systems and Operations Research 20, 394–422.

Schrijver, Alexander 2003: Combinatorial optimization. Polyhedra and efficiency. Vol. A. Berlin: Springer-Verlag. Paths, flows, matchings, Chapters 1–38.

Schrijver, Alexander 2003: Combinatorial optimization. Polyhedra and efficiency. Vol. B. Berlin: Springer-Verlag. Matroids, trees, stable sets, Chapters 39–69.

Schrijver, Alexander 2003: Combinatorial optimization. Polyhedra and efficiency. Vol. C. Berlin: Springer-Verlag. Disjoint paths, hypergraphs, Chapters 70–83.

Truemper, K. 1992: Matroid decomposition. Boston, MA: Academic Press Inc.

Welsh, D. J. A. 1976: Matroid theory. London: Academic Press Harcourt Brace Jovanovich Publishers. L. M. S. Monographs, No. 8.

Frauke Liers, Enzo Marinari, Ulrike Pagacz, Federico Ricci-Tersenghi, Vera Schmitz (2009): Non-disordered glassy models with a tunable interaction range.

Stephan Mertens 1996: Exhaustive search for low-autocorrelation binary sequences. J. Phys. A 29, L473-L481.

Orlova, G. I., Dorfman, Ya. G. 1972: Finding the maximum cut in a graph. Izv. Akad. Nauk SSSR Tehn. Kibernet. 3, 155–159.

F. Hadlock 1975: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM J. Comput. 4/3, 221-225.

Francisco Barahona 1982: On the Computational Complexity of Ising Spin Glass Models. J. Physics A: Mathematical and General 15 10, 3241-3253.

Barahona, F., Maynard, R., Rammal, R., Uhry, J.P. 1982: Morphology of ground states of two-dimensional frustration model. Journal of Physics A Mathematical General 15, 673-699.

Francisco Barahona 1983: The max-cut problem on graphs not contractible to K_5. Operations Research Letters 2/3, 107–111.

Francisco Barahona 1993: On cuts and matchings in planar graphs. Math. Program. 60/1, 53–68.

Liers, Frauke, Pardella, Gregor (2008): A simple MAX-CUT algorithm for planar graphs. Combinatorial Optimization in Physics (COPhy).

Wei-Kuan Shih, Kuo Wu, Y. S. Kuo 1990: Unifying maximum cut and minimum cut of a planar graph. IEEE Transactions on Computers 9, 694–697.

Lipton, Richard J., Tarjan, Robert Endre 1979: A separator theorem for planar graphs. SIAM J. Appl. Math. 36/2, 177–189.

Lipton, Richard J., Tarjan, Robert Endre 1980: Applications of a planar separator theorem. SIAM J. Comput. 9/3, 615–627.