scientific article; zbMATH DE number 1944141
From MaRDI portal
Publication:4407449
zbMath1040.90032MaRDI QIDQ4407449
Publication date: 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shannon capacityinference rulessemidefinite programsmaximum cutsdiscrete linear and quadratic programs
Related Items
On the linear classification of even and odd permutation matrices and the complexity of computing the permanent, Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Max \(k\)-cut and the smallest eigenvalue, Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization, Matrix Relaxations in Combinatorial Optimization, SOS Is Not Obviously Automatizable, Even Approximately, Negativizability: a useful property for distributed state estimation and control in cyber-physical systems, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, Approximating projections by quantum operations, Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity, A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems, Generating valid linear inequalities for nonlinear programs via sums of squares, A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, Ideals of graph homomorphisms, Convex hulls of curves of genus one, Unnamed Item, Undecidability of linear inequalities in graph homomorphism densities, A guide to conic optimisation and its applications, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, On Farkas lemma and dimensional rigidity of bar frameworks, Enumeration of 2-level polytopes, Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation, Semidefinite programming and combinatorial optimization, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Semidefinite relaxations for partitioning, assignment and ordering problems, Convex Hulls of Algebraic Sets, Maximum algebraic connectivity augmentation is NP-hard, Semidefinite relaxations for partitioning, assignment and ordering problems, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Gray code enumeration of families of integer partitions, Optimality conditions and global convergence for nonlinear semidefinite programming, Two-Level Polytopes with a Prescribed Facet, Unnamed Item
