scientific article; zbMATH DE number 2159019
From MaRDI portal
Publication:4668573
Recommendations
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- scientific article; zbMATH DE number 2159018
- Faster exact solution of sparse maxcut and QUBO problems
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
Cited in
(36)- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A framework for solving mixed-integer semidefinite programs
- Lifting and separation procedures for the cut polytope
- New approaches for optimizing over the semimetric polytope
- Increasing the attraction area of the global minimum in the binary optimization problem
- Optimal cuts in graphs and statistical mechanics
- QUBO software
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- An improved interior-point cutting-plane method for binary quadratic optimization
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- MARLEDA: effective distribution estimation through Markov random fields
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Partial Lasserre relaxation for sparse Max-Cut
- The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
- Computational approaches to MAX-cut
- A class of spectral bounds for max \(k\)-cut
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Crossing Minimization in Storyline Visualization
- Complexity of the weighted max-cut in Euclidean space
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- scientific article; zbMATH DE number 2159018 (Why is no real title available?)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Quantum annealing versus digital computing. An experimental comparison
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Valuated matroid-based algorithm for submodular welfare problem
- An algorithm for finding the first excited state in the random-field Ising model
- Global approaches for facility layout and VLSI floorplanning
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A multiple search operator heuristic for the max-k-cut problem
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4668573)
