Rank of Handelman hierarchy for Max-Cut (Q408389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2011.07.006 / rank
Normal rank
 
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.1016/j.orl.2011.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121908678 / 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: Integrality gaps for Sherali-Adams relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Lasserre Ranks of Some Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing polynomials by positive linear functions on compact convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / 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: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / 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: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Representation of the Matching Polytope Via Semidefinite Liftings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2011.07.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:42, 9 December 2024

scientific article
Language Label Description Also known as
English
Rank of Handelman hierarchy for Max-Cut
scientific article

    Statements

    Rank of Handelman hierarchy for Max-Cut (English)
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    polynomial optimization
    0 references
    rank of hierarchical relaxation
    0 references
    Handelman hierarchy
    0 references
    max-cut
    0 references
    RLT
    0 references

    Identifiers