Spin Glass and Pseudo-Boolean Optimization
- 169 Downloads
The minimization of pseudo-boolean functions started in the early sixties and since then has been studied as a discrete optimization problem in operations research, mathematical programming and combinatorics. The author was quite surprised to learn that more recently the problem emerged as the spin glass problem in statistical mechanics. The probabilistic approach developed there has been applied to various combinatorial problems and even to biology or cellular automata.
KeywordsCellular Automaton Steep Descent Discrete Optimization Problem Early Sixty Quadratic Case
Unable to display preview. Download preview PDF.
- Hammer, P.L., Rudeanu S., Boolean Methods in Operations Research and Related Areas, Springer Verlag 1968, French translation, Dunod 1969.Google Scholar
- Hammer, P.L., Rosenberg, I.G., Equivalent forms of zero-one programs. In Applications of number theory to numerical analysis, Academic Press 1972 pp. 453–463.Google Scholar
- Rosenberg, I.G., 0–1 optimization and non-linear programming, R.A.I.R.O. 6 V-2 (1972) 95–97.Google Scholar
- Rosenberg, I.G., 0–1 optimization and non-linear programming. Talk presented at TIMS/ORSA Meeting Miami.Fla,Nov.3–5 1976, # FP 21.1 p 266Google Scholar