A continuous nonlinear optimization perspective on the spin glass problem
From MaRDI portal
Cites work
- A conjecture on a continuous optimization model for the Golomb ruler problem
- A review of the available construction methods for Golomb rulers
- An improved linearization strategy for zero-one quadratic programming problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- scientific article; zbMATH DE number 3404028 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Partial reformulation-linearization based optimization models for the Golomb ruler problem
- Randomized heuristics for the Max-Cut problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- Uniqueness of Gibbs measures for an Ising model with continuous spin values on a Cayley tree
This page was built for publication: A continuous nonlinear optimization perspective on the spin glass problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7235867)