A discrete dynamic convexized method for the max-cut problem (Q1761827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Mixed linear and semidefinite programming for combinatorial and quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / 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: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: An improved rounding method and semidefinite programming relaxation for graph partition / 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: Lagrangian smoothing heuristics for Max-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete filled function algorithm for approximate global solutions of max-cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5440597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation algorithm for max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming / rank
 
Normal rank

Revision as of 21:00, 5 July 2024

scientific article
Language Label Description Also known as
English
A discrete dynamic convexized method for the max-cut problem
scientific article

    Statements

    A discrete dynamic convexized method for the max-cut problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    max-cut problem
    0 references
    local search
    0 references
    dynamic convexized method
    0 references

    Identifiers