Matrix relaxations in combinatorial optimization
From MaRDI portal
Publication:2897308
DOI10.1007/978-1-4614-1927-3_17zbMATH Open1242.90201OpenAlexW79937293MaRDI QIDQ2897308FDOQ2897308
Authors: Franz Rendl 
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_17
Recommendations
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Numerical evaluation of SBmethod
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Title not available (Why is that?)
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Regularization methods for semidefinite programming
- Assignment Problems
- Semidefinite Programming
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Geometric algorithms and combinatorial optimization
- Approximate graph coloring by semidefinite programming
- On the Shannon capacity of a graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A variational approach to copositive matrices
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A boundary point method to solve semidefinite programs
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- The Operator $\Psi$ for the Chromatic Number of a Graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- Improving the performance guarantee for approximate graph coloring
- The NP-completeness of the bandwidth minimization problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A comparison of the Delsarte and Lovász bounds
- Complexity Results for Bandwidth Minimization
- Title not available (Why is that?)
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- On copositive programming and standard quadratic optimization problems
- Semidefinite programming and integer programming
- New approximation guarantee for chromatic number
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- An Augmented Primal-Dual Method for Linear Conic Programs
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- A spectral approach to bandwidth and separator problems in graphs
- A Copositive Programming Approach to Graph Partitioning
- Graph partitioning using linear and semidefinite programming
- Title not available (Why is that?)
- Semidefinite programming
- Fastest Mixing Markov Chain on a Graph
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Semidefinite relaxations for integer programming
- Semidefinite programming in combinatorial optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- On the hardness of approximating the chromatic number
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)
