Lagrangian smoothing heuristics for Max-cut (Q2491324): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NOA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119186543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the Max-Cut problem / 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: Q4369265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank

Latest revision as of 16:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Lagrangian smoothing heuristics for Max-cut
scientific article

    Statements

    Lagrangian smoothing heuristics for Max-cut (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    quadratic programming
    0 references
    combinatorial optimization
    0 references
    non-convex programming
    0 references
    approximation methods and heuristics
    0 references
    pathfollowing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references