Computational approaches to MAX-cut
From MaRDI portal
Publication:2802547
Recommendations
Cites work
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Approximate graph coloring by semidefinite programming
- Benchmarking optimization software with performance profiles.
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Exact algorithms for the quadratic linear ordering problem
- Extremal correlation matrices
- Facets of the linear ordering polytope
- Geometry of cuts and metrics
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Low-rank optimization on the cone of positive semidefinite matrices
- Multiplier and gradient methods
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- On the Shannon capacity of a graph
- On the cut polytope
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Problems of distance geometry and convex properties of quadratic maps
- Semidefinite programming and integer programming
- Semidefinite relaxations of ordering problems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Trust-region methods on Riemannian manifolds
Cited in
(15)- Generalised 2-circulant inequalities for the max-cut problem
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- scientific article; zbMATH DE number 7650221 (Why is no real title available?)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Canonical dual approach to solving the maximum cut problem
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A MAX-CUT formulation of 0/1 programs
- Quadratic Combinatorial Optimization Using Separable Underestimators
- A note on the 2-circulant inequalities for the MAX-cut problem
- Recognizing max-flow min-cut path matrices
- Advanced scatter search for the max-cut problem
- The maximum cut problem
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Towards Algorithmic Cut-Introduction
This page was built for publication: Computational approaches to MAX-cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802547)
