Spectral bounds for the maximum cut problem (Q3632965): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20220 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4231459855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs and the Smallest Eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using domain decomposition to find graph bisectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger linear programming relaxations of max-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / 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: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of the random hyperplane rounding technique for MAX CUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected relative error of the polyhedral approximation of the max- cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank

Latest revision as of 16:42, 1 July 2024

scientific article
Language Label Description Also known as
English
Spectral bounds for the maximum cut problem
scientific article

    Statements

    Spectral bounds for the maximum cut problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    0 references
    eigenvalues
    0 references
    relaxations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references