Lifting and separation procedures for the cut polytope (Q403653): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C09 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 82D30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6336108 / rank
 
Normal rank
Property / zbMATH Keywords
 
max-cut problem
Property / zbMATH Keywords: max-cut problem / rank
 
Normal rank
Property / zbMATH Keywords
 
cut polytope
Property / zbMATH Keywords: cut polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
separation algorithm
Property / zbMATH Keywords: separation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank
Property / zbMATH Keywords
 
unconstrained Boolean quadratic programming
Property / zbMATH Keywords: unconstrained Boolean quadratic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
Ising spin Glass model
Property / zbMATH Keywords: Ising spin Glass model / rank
 
Normal rank

Revision as of 16:57, 29 June 2023

scientific article
Language Label Description Also known as
English
Lifting and separation procedures for the cut polytope
scientific article

    Statements

    Lifting and separation procedures for the cut polytope (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    max-cut problem
    0 references
    cut polytope
    0 references
    separation algorithm
    0 references
    branch-and-cut
    0 references
    unconstrained Boolean quadratic programming
    0 references
    Ising spin Glass model
    0 references

    Identifiers

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