Semidefinite programming in combinatorial optimization (Q1365053): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity and nondegeneracy in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the independence number via the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of distance geometry and convex properties of quadratic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Betweenness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized graph products, chromatic numbers, and Lovasz j-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of vertex packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem that is easier to solve on the unit-cost algebraic RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q98060311 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02614315 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085427851 / rank
 
Normal rank

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming in combinatorial optimization
scientific article

    Statements

    Semidefinite programming in combinatorial optimization (English)
    0 references
    0 references
    25 May 1998
    0 references
    coding theory
    0 references
    stable sets
    0 references
    semidefinite programming
    0 references
    Lovász theta function
    0 references
    strong valid inequalities
    0 references
    maximum cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers