Matrix Relaxations in Combinatorial Optimization (Q2897308)

From MaRDI portal

Revision as of 11:26, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Matrix Relaxations in Combinatorial Optimization	scientific article

Statements

scholarly article

0 references

Matrix Relaxations in Combinatorial Optimization (English)

0 references

0 references

Mixed Integer Nonlinear Programming

0 references

publication date

10 July 2012

0 references

zbMATH Keywords

semidefinite optimization

0 references

lift-and-project

0 references

integer programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-1927-3_17

0 references

A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem

0 references

New approximation guarantee for chromatic number

0 references

0 references

0 references

0 references

An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs

0 references

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

0 references

On copositive programming and standard quadratic optimization problems

0 references

Fastest Mixing Markov Chain on a Graph

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Assignment Problems

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function

0 references

0 references

Copositive programming motivated bounds on the stability and the chromatic numbers

0 references

Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION

0 references

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

0 references

Semidefinite programming in combinatorial optimization

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

0 references

Geometric algorithms and combinatorial optimization

0 references

Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization

0 references

The Operator $\Psi$ for the Chromatic Number of a Graph

0 references

Semidefinite programming

0 references

Numerical evaluation of SBmethod

0 references

A spectral approach to bandwidth and separator problems in graphs

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

A Variational Approach to Copositive Matrices

0 references

An Augmented Primal-Dual Method for Linear Conic Programs

0 references

Approximate graph coloring by semidefinite programming

0 references

0 references

On the hardness of approximating the chromatic number

0 references

On the solution of large-scale SDP problems by the modified barrier method using iterative solvers

0 references

0 references

0 references

Graph partitioning using linear and semidefinite programming

0 references

On the Shannon capacity of a graph

0 references

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

Complexity Results for Bandwidth Minimization

0 references

Regularization Methods for Semidefinite Programming

0 references

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results

0 references

The NP-completeness of the bandwidth minimization problem

0 references

A Copositive Programming Approach to Graph Partitioning

0 references

Copositive and semidefinite relaxations of the quadratic assignment problem

0 references

A boundary point method to solve semidefinite programs

0 references

Semidefinite Relaxations for Integer Programming

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

A comparison of the Delsarte and Lovász bounds

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems

0 references

0 references

The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

0 references

A study of search directions in primal-dual interior-point methods for semidefinite programming

0 references

Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems

0 references

Semidefinite Programming

0 references

Improving the performance guarantee for approximate graph coloring

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-1-4614-1927-3_17

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2897308

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2897308&oldid=35288562"