Pages that link to "Item:Q2500052"
From MaRDI portal
The following pages link to Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052):
Displayed 12 items.
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Adaptive extremal optimization by detrended fluctuation analysis (Q2465006) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- The one-dimensional Ising model: mutation versus recombination (Q2575079) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- Stochastic Tunneling Approach for Global Minimization of Complex Potential Energy Landscapes (Q4492668) (← links)
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)