Node and edge relaxations of the max-cut problem (Q1319044): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / 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: Experiments in quadratic 0-1 programming / 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: Q3113173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137209 / 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: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02238072 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W129046272 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Node and edge relaxations of the max-cut problem
scientific article

    Statements

    Node and edge relaxations of the max-cut problem (English)
    0 references
    0 references
    0 references
    12 April 1994
    0 references
    semidefinite programming
    0 references
    min-max eigenvalue problem
    0 references
    upper bound
    0 references
    max- cut problem
    0 references
    nonsmooth optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references