Pages that link to "Item:Q2500052"

The following pages link to Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052):

Displaying 26 items.

• On the diameter of cut polytopes (Q271649) (← links)
• Lifting and separation procedures for the cut polytope (Q403653) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
• Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture (Q644918) (← links)
• Canonical dual approach to solving the maximum cut problem (Q693126) (← 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)
• Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
• Incomplete inference for graph problems (Q1947627) (← links)
• Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← 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)
• The spectral bundle method with second-order information (Q2926057) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
• A modeling and computational study of the frustration index in signed networks (Q6068535) (← links)
• On optimization problems in acyclic hypergraphs (Q6161450) (← links)