Matrix relaxations in combinatorial optimization
From MaRDI portal
Publication:2897308
Recommendations
Cites work
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1182569 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 1489798 (Why is no real title available?)
- scientific article; zbMATH DE number 1426485 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A Copositive Programming Approach to Graph Partitioning
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- A boundary point method to solve semidefinite programs
- A comparison of the Delsarte and Lovász bounds
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A spectral approach to bandwidth and separator problems in graphs
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A variational approach to copositive matrices
- An Augmented Primal-Dual Method for Linear Conic Programs
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Approximate graph coloring by semidefinite programming
- Approximation of the stability number of a graph via copositive programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Assignment Problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity Results for Bandwidth Minimization
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Fastest Mixing Markov Chain on a Graph
- Geometric algorithms and combinatorial optimization
- Graph partitioning using linear and semidefinite programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improving the performance guarantee for approximate graph coloring
- Maxima for Graphs and a New Proof of a Theorem of Turán
- New approximation guarantee for chromatic number
- Numerical evaluation of SBmethod
- On approximate graph colouring and MAX-k-CUT algorithms based on the -function
- On copositive programming and standard quadratic optimization problems
- On the Shannon capacity of a graph
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the hardness of approximating the chromatic number
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Regularization methods for semidefinite programming
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Semidefinite Programming
- Semidefinite programming
- Semidefinite programming and integer programming
- Semidefinite programming in combinatorial optimization
- Semidefinite relaxations for integer programming
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some NP-complete problems in quadratic and nonlinear programming
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- The NP-completeness of the bandwidth minimization problem
- The Operator $\Psi$ for the Chromatic Number of a Graph
Cited in
(9)- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Relaxations of combinatorial problems via association schemes
- Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
- Semidefinite programming for discrete optimization and matrix completion problems
- Improving ADMMs for solving doubly nonnegative programs through dual factorization
- McCormick-Based Relaxations of Algorithms
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Optimization problems involving matrix multiplication with applications in materials science and biology
- The SAT+CAS method for combinatorial search with applications to best matrices
This page was built for publication: Matrix relaxations in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897308)
